cf Round #634 (Div. 3)D题

D. Anti-Sudoku
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a correct solution of the sudoku puzzle. If you don’t know what is the sudoku, you can read about it here.

The picture showing the correct sudoku solution:

Blocks are bordered with bold black color.

Your task is to change at most 9 elements of this field (i.e. choose some 1≤i,j≤9 and change the number at the position (i,j) to any other number in range [1;9]) to make it anti-sudoku. The anti-sudoku is the 9×9 field, in which:

Any number in this field is in range [1;9];
each row contains at least two equal elements;
each column contains at least two equal elements;
each 3×3 block (you can read what is the block in the link above) contains at least two equal elements.
It is guaranteed that the answer exists.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.

Output
For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.

Example
input
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563
output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563
题目大意：给你一个正确的数独，你最多可以修改9个元素，使得修改后的数组满足每行每列每个九宫格都有2个相同的元素。
思路：原来每行每列每个九宫格每个元素都不相同，那么我们只需要修改其中任意一个数字改成1~9的其他数字即可。如把8改成3。
代码：

#include <iostream>
using namespace std;

char a[10][10];
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        for(int i = 1; i <= 9; i++)
            scanf("%s", a[i] + 1);
            printf("\n");
        for(int i = 1; i <= 9; i++){
            for(int j = 1; j <= 9; j++)
            {
                if(a[i][j] == '8')
                    printf("3");
                else
                    printf("%c", a[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}