for (i = 0; i < n; i ++)
{
for (j = 0; j < queens[i]; j ++)
{
printf("*");
}
printf("@");
for (j = n; j > queens[i]; j --)
{
printf("*");
};
putchar('\n');
}
printf("Please press enter to see the next answer\n");
getch();
}
int CheckTheChessBoard(int queens[], int i)
{
int j, k;
for (j = 0; j <= i; j ++)
{
for (k = 0; k <= i; k ++)
{
if (j != k && (queens[j] == queens[k] || abs(queens[j] - queens[k]) == abs(j - k)))
{
return 0;
}
}
}
return 1;
}
void Trial(int queens[], int i, int n)
{
if (i >= n)
{
c ++;
PrintTheChessBoard(queens, n);
}
else
{
int j;
for (j = 0; j < n; j ++)
{
queens[i] = j;
评论0