To submit your application to the final competition, you must support the automatic benchmark system. Your application will be compiled with optimizations. You need to check for the -t which is followed by a path to a test file.
The test file has the following format. The first number specifies the number of problems in the file. For each problem there are 81 numbers which should be read in a 9x9 pattern.
3
0 0 7 0 5 0 0 0 0
0 0 1 9 0 0 0 4 0
3 2 0 0 0 0 0 9 0
6 3 0 4 0 0 0 0 5
0 0 0 0 0 0 0 0 0
9 0 0 0 0 2 0 3 8
0 4 0 0 0 0 0 8 3
0 6 0 0 0 7 1 0 0
0 0 0 0 2 0 4 0 0
0 0 0 0 0 0 0 1 2
0 0 0 0 0 0 0 0 3
0 0 2 3 0 0 4 0 0
0 0 1 8 0 0 0 0 5
0 6 0 0 7 0 8 0 0
0 0 0 0 0 9 0 0 0
0 0 8 5 0 0 0 0 0
9 0 0 0 4 0 5 0 0
4 7 0 0 0 6 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 3 0 8 5
0 0 1 0 2 0 0 0 0
0 0 0 5 0 7 0 0 0
0 0 4 0 0 0 1 0 0
0 9 0 0 0 0 0 0 0
5 0 0 0 0 0 0 7 3
0 0 2 0 1 0 0 0 0
0 0 0 0 4 0 0 0 9
You need to read the problems in order, and output all solutions.
The output of your program should be exactly as follows:
Case #0:
4 9 7 2 5 3 8 6 1
5 8 1 9 7 6 3 4 2
3 2 6 1 8 4 5 9 7
6 3 2 4 9 8 7 1 5
1 7 8 6 3 5 9 2 4
9 5 4 7 1 2 6 3 8
7 4 9 5 6 1 2 8 3
2 6 3 8 4 7 1 5 9
8 1 5 3 2 9 4 7 6
Case #1:
8 3 9 4 6 5 7 1 2
1 4 6 7 8 2 9 5 3
7 5 2 3 9 1 4 8 6
3 9 1 8 2 4 6 7 5
5 6 4 1 7 3 8 2 9
2 8 7 6 5 9 3 4 1
6 2 8 5 3 7 1 9 4
9 1 3 2 4 8 5 6 7
4 7 5 9 1 6 2 3 8
Case #2:
9 8 7 6 5 4 3 2 1
2 4 6 1 7 3 9 8 5
3 5 1 9 2 8 7 4 6
1 2 8 5 3 7 6 9 4
6 3 4 8 9 2 1 5 7
7 9 5 4 6 1 8 3 2
5 1 9 2 8 6 4 7 3
4 7 2 3 1 9 5 6 8
8 6 3 7 4 5 2 1 9You must output all solutions. When parsing numbers, whitespace characters are ignored, so feel free to separate solutions by a blank line for readability.