#include <stdio.h>
#define N 9
void init(char a[N][N]){
    int i, j;
    char temp;
    FILE *fp = fopen("data.txt", "r");
    for(i = 0; i < N; i++)
        for(j = 0; j < N; j++)
        {
            fscanf(fp, "%c", &temp); //读书文件中的初始数据，符号 .  代表空格子
            if(((temp > 48) && (temp < 58))|| (temp == '.'))
                a[i][j] = temp;
            else
                j--;
        }
    fclose(fp);
   
}
void print(char a[N][N])
{
    int i, j;
    for(i = 0; i < N; i++)
    {
        for(j = 0; j < N; j++)
        {
            printf("%c ",a[i][j]);
            if((j == 2) || (j == 5))
                printf(" ");
        }
        printf("\n");
        if((i == 2) || (i == 5))
            printf("\n");
    }
    printf("\n");

}


int judge(char a[N][N], int i, int j, int k)  //判断第i行 第j列是否可以为k
{
    int m, n;
    int t1 =(i / 3) * 3, t2 = (j / 3) * 3;
    for(n = 0; n < N; n++)           //判断行
    {
        if(a[i][n] == k)
            return 0;
    }
    for(m = 0; m < N; m++)            //判断列
    {
        if(a[m][j] == k)
            return 0;
    }
    for(m = t1; m < t1 + 3; m++)    //判断小九宫格
    {
        for(n = t2; n < t2 + 3; n++)
        {
            if(a[m][n] == k)
                return 0;
        }
    }
    return -1;
}
void travelsal(char a[N][N], int p) //遍历，p为坐标
{
    char temp[N][N];
    int i, j, k, flag;
    for(i = 0; i < N; i++)
    {
        for(j = 0; j < N; j++)
        {
            temp[i][j] = a[i][j];
        }
    }
    i = p / N;   //求第p个数的行数，列数
    j = p % N;
    if(a[i][j] != '.')   //有原始数据
    {
        if(p == (N * N - 1))  //是否是最后一个数
            print(temp);
        else
            travelsal(temp, p + 1);  //不是最后一个数就遍历下一个数
    }
    else   //无原始数据
        {
            for(k = 1; k <= N; k++)
            {               
                flag = judge(temp, i, j, k);
                if(flag)
                {
                    temp[i][j] = k + '0';  //转换为字符型
                    if(p == (N * N - 1))
                        print(temp);
                    else
                    travelsal(temp, p + 1);
                temp[i][j] = '.';
                }
            }
        }
}

int main(){
    char a[N][N];
    init(a);
    print(a);
    travelsal(a, 0);
    return 0;
}