*题目编号1019
*简单题意:在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。对于给定的N,求出有多少种合法的放置方法。
*解题思路:由于N<=10,原谅我直接列举了出来
*AC源码:
# include<iostream>
using namespace std;
int main()
{
int n;
while (cin >> n&&n != 0)
{
switch (n)
{
case 1:cout << 1 << endl;break;
case 2:cout << 0 << endl; break;
case 3:cout << 0 << endl; break;
case 4:cout << 2 << endl; break;
case 5:cout << 10 << endl; break;
case 6:cout << 4 << endl; break;
case 7:cout << 40 << endl; break;
case 8:cout << 92 << endl; break;
case 9:cout << 352 << endl; break;
case 10:cout << 724 << endl; break;
}
}
return 0;
}
N皇后问题
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 42 Accepted Submission(s) : 20
1<br>8<br>5<br>0<br><br>
1<br>92<br>10<br><br>