#pragma warning(disable:4996)
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
using namespace std;
int n = 5;
int flag[6], pre[6];
void init()
{
memset(flag, 0, sizeof(flag));
memset(pre, 0, sizeof(pre));
}
void queen(int index)
{
if (index == n + 1)
{
for (int i = 0; i <= 5; i++)
cout << pre[i];
cout << endl;
return;
}
for (int i = 1; i <= n; i++)
{
if (flag[i] == 0)
{
int int_flag = 1;
for (int j = 1; j < index; j++)
{
if (abs(index - j) == abs(i - pre[j]))
{
int_flag = 0;
break;
}
}
if (int_flag == 1)
{
pre[index] = i;
flag[i] = 1;
queen(index + 1);
flag[i] = 0;
}
}
}
}
int main()
{
init();
queen(1);
return 0;
}
回溯法解决5皇后问题
最新推荐文章于 2022-05-24 12:24:35 发布