uva11520 Fill the Square

In this problem, you have to draw a square using uppercase English
Alphabets. To be more precise, you will be given a square grid with
some empty blocks and others already lled for you with some letters
to make your task easier. You have to insert characters in every empty
cell so that the whole grid is lled with alphabets. In doing so you
have to meet the following rules:
1. Make sure no adjacent cells contain the same letter; two cells are adjacent if they share a common edge.
2. There could be many ways to ll the grid. You have to ensure you make the lexicographically smallest one. Here, two grids are checked
in row major order when comparing lexicographically. Input The rst
line of input will contain an integer that will determine the number
of test cases. Each case starts with an integer n ( n 10), that
represents the dimension of the grid. The next n lines will contain n
characters each. Every cell of the grid is either a . ' or a
letter from [ A , Z ]. Here a . ’ represents an empty cell. Output
For each case, rst output ` Case
# : ’ (# replaced by case number) and in the next n lines output the input matrix with the empty cells lled heeding the rules above.

按字典序枚举每一位取最小。因为最多有上下左右四个限制，一定不会无解。

#include<cstdio>
#include<cstring>
char a[15][15];
int xx[]={0,0,1,-1},yy[]={1,-1,0,0},n;
bool ok(int x,int y)
{
    return x>=1&&x<=n&&y>=1&&y<=n;
}
int main()
{
    int i,j,k,m,p,q,x,y,z,T,K;
    bool ban[10];
    scanf("%d",&T);
    for (K=1;K<=T;K++)
    {
        scanf("%d",&n);
        for (i=1;i<=n;i++)
          scanf("%s",a[i]+1);
        for (i=1;i<=n;i++)
          for (j=1;j<=n;j++)
            if (a[i][j]=='.')
            {
                memset(ban,0,sizeof(ban));
                for (k=0;k<4;k++)
                  if (ok(x=i+xx[k],y=j+yy[k])&&a[x][y]!='.'&&a[x][y]<='E')
                    ban[a[x][y]-'A']=1;
                for (k=0;ban[k];k++);
                a[i][j]='A'+k;
            }
        printf("Case %d:\n",K);
        for (i=1;i<=n;i++)
          printf("%s\n",a[i]+1);
    }
}