bool isvalid(const vector<int>&p, int k)
{
for (int i = 0; i < k; i++)
if (p[i] == p[k] ||abs( p[i] - p[k]) == abs(i - k))
return false;
return true;
}
void rsolve(vector<int>&p, int k, int &cnt)
{
int n = p.size();
if (k == n) { ++cnt; copy(p.begin(), p.end(), ostream_iterator<int>(cout, "")); cout << endl; return; }
for (int i = 0; i < n; ++i)
{
p[k] = i+1;
if (isvalid(p, k)) { rsolve(p, k+1, cnt); }
}
}
int main()
{
int cnt = 0;
vector<int>p(8);
rsolve(p, 0, cnt);
cout << cnt;
return 0;
}
C++简单实现八皇后
最新推荐文章于 2023-09-03 14:25:03 发布