D. Anti-Sudoku Round #634 (Div. 3)

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
inputCopy
1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563

output
154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563

思路：题目的大致意思就是改最多9个数字，使得每一行每一列都有两个相同的，以及每个3x3的格子里面也有两个相同的，所以我们把下面9个改一下就行。

#include<bits/stdc++.h>
using namespace std;
 char a[15][15];
int main()
{
    int t; cin>>t;
    while(t--){
        for(int i=1;i<=9;i++){
            for(int j=1;j<=9;j++){
                cin>>a[i][j];
            }
        }
        if(a[1][1]!='9') a[1][1]++;
        else a[1][1]--;
        if(a[2][5]!='9') a[2][5]++;
        else a[2][5]--;
        if(a[3][9]!='9') a[3][9]++;
        else a[3][9]--;
        if(a[5][2]!='9') a[5][2]++;
        else a[5][2]--;
        if(a[6][6]!='9') a[6][6]++;
        else a[6][6]--;
        if(a[4][7]!='9') a[4][7]++;
        else a[4][7]--;
        if(a[9][3]!='9') a[9][3]++;
        else a[9][3]--;
        if( a[7][4]!='9') a[7][4]++;
        else a[7][4]--;
        if( a[8][8]!='9') a[8][8]]++;
        else a[8][8]--;
        for(int i=1;i<=9;i++){
            for(int j=1;j<=9;j++){
                cout<<a[i][j];
            }
            cout<<endl;
        }
    }
    return 0;
}