思路题

Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller. 

Actually, Yi Sima was playing it different. First of all, he tried to generate a  4×4 4×4 board with every row contains 1 to 4, every column contains 1 to 4. Also he made sure that if we cut the board into four  2×2 2×2 pieces, every piece contains 1 to 4. 

Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover. 

Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!

Input

The first line of the input gives the number of test cases,  T(1≤T≤100) T(1≤T≤100).  T T test cases follow. Each test case starts with an empty line followed by 4 lines. Each line consist of 4 characters. Each character represents the number in the corresponding cell (one of '1', '2', '3', '4'). '*' represents that number was removed by Yi Sima. 

It's guaranteed that there will be exactly one way to recover the board.

Output

For each test case, output one line containing  Case #x:, where  x x is the test case number (starting from 1). Then output 4 lines with 4 characters each. indicate the recovered board.

Sample Input

3
****
2341
4123
3214
*243
*312
*421
*134
*41*
**3*
2*41
4*2*

Sample Output

Case #1:
1432
2341
4123
3214
Case #2:
1243
4312
3421
2134
Case #3:
3412
1234
2341
4123
题意：这是一个和数独很像的题型，但是又有一点稍微不太一样
*是你要填的数，你要填的这个数满足的三个条件。1.每一行是1,2,3,4。  2.每一列也是1，2,3,4。  3.
4*4 的方格又分成4个2*2的方格，每一个2*2的方格也是1,2,3,4。满足这三个条件，更新这一个图。然后输出这个图
这一道题可以用搜素和一般的方法来做。搜索呢比较保险，思维题刚刚凑巧了。
思维题思路：
就是找到一个带*的点，判断它所在的行，列，2*2的方格是不是同时满足这个条件。满足更新，不满足不更新。
代码：
char a[10][10];
int c1[10],c2[10];
int vis[10];
int flag;
void change(int x,int y)
{
    for(int i=1;i<=4;i++)               //行和列的判断是不是满足条件
    {
        if(a[x][i]!='*')
            c1[a[x][i]-'0']=1;
        if(a[i][y]!='*')
            c2[a[i][y]-'0']=1;
    }

//   小矩阵满不满足条件
    if(x<=2)
    {
        if(y<=2)
        {
            for(int i=1;i<=2;i++)
                for(int j=1;j<=2;j++)
                if(a[i][j]!='*')
                vis[a[i][j]-'0']=1;
        }
        else
            for(int i=1;i<=2;i++)
            for(int j=3;j<=4;j++)
            if(a[i][j]!='*')
            vis[a[i][j]-'0']=1;
    }
    else
    {
        if(y<=2)
        {
            for(int i=3;i<=4;i++)
                for(int j=1;j<=2;j++)
                if(a[i][j]!='*')
                vis[a[i][j]-'0']=1;


        }
        else
        {
            for(int i=3;i<=4;i++)
                for(int j=3;j<=4;j++)
                if(a[i][j]!='*')
                vis[a[i][j]-'0']=1;
        }
    }

    flag=0;int z;
    for(int i=1;i<=4;i++)
    {
        if(!c1[i]&&!c2[i]&&!vis[i])    //仅仅同时存在一个没有被标记的数满足行和列，小矩                     阵 ，并且只有一次，那么这个点就是这个数。
        {
            flag++,z=i;
        }
    }
    if(flag==1)
        a[x][y]=z+'0';
}
int main()
{
    int T;
    int t=0;
   // scanf("%d",&T);
   cin>>T;
    //getchar();
    while(T--)
    {
        t++;
        for(int i=1;i<=4;i++)
        {
            for(int j=1;j<=4;j++)
           // scanf("%c",&a[i][j]);
           // getchar();
           cin>>a[i][j];
        }
        flag=1;
        while(flag)
        {
            flag=0;
            for(int i=1;i<=4;i++)
            {
                for(int j=1;j<=4;j++)
                {
                    if(a[i][j]=='*')
                    {
                        memset(c1,0,sizeof(c1));
                        memset(c2,0,sizeof(c2));
                        memset(vis,0,sizeof(vis));
                        change(i,j);
                    }
                }
            }
        }
       // printf("Case #%d:\n",t);
        cout<<"Case #"<<t<<":"<<endl;
        for(int i=1;i<=4;i++)
        {
            for(int j=1;j<=4;j++)
            //printf("%c",a[i][j]);
            cout<<a[i][j];
            //printf("\n");
            cout<<endl;
        }
    }
}

比较坑的地方就是能不用一个字母一个字母的输入，就不用，或者是用c++;wa了很多发终于找到了怎么回事。
注意事项：用字符串输入或者是c++输入。。。。。