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

Problem Link :  https://codeforces.com/contest/1335/problem/D 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int t,i,j;

    cin>>t;

    while(t--)

    {

        string s[15];

        for(i=0; i<9; i++)

        {

            cin>>s[i];

            for(j=0; j<9; j++)

            {

                if(s[i][j]=='1')

                {

                    s[i][j]='2';

                }

            }

            cout<<s[i]<<endl;

        }

    }

}