八皇后问题

#include <stdio.h>
#include <stdlib.h>
#define N 8
bool matrix[N][N] = {0};
void Print(bool m[N ][N ]){
    static int count = 1;
    printf("Case %d:
", count++);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++)
            m[i][j]==1?printf("Q") : printf(".");
        printf("
");
    }
    printf("
");
}
bool Safety(bool m[N][N], int row, int col)
{
    for (int i = 0; i < row ; i++)
    {
         for (int j = 0; j < N; j++)
                   if(m[i][j]==1&&(j==col||abs(row-i)==abs(col-j)))
                return false;
    }
    return true;
}
void BackTrack(const int i) {
    if (i >=N)
        Print(matrix);
    else
        for (int j = 0; j < N; ++j) {
            matrix[i][j] = 1;
            if(Safety(matrix,i,j))
                         BackTrack(i + 1);
            matrix[i][j] = 0;
        }
}
int main(void)
{
    BackTrack(0);
    return 0;
}