bzoj 3101 N皇后构造一种解 数学

3101: N皇后

Time Limit: 10 Sec  Memory Limit: 128 MBSec  Special Judge
Submit: 70  Solved: 32
[Submit][Status]

Description

n*n的棋盘,在上面摆下n个皇后，使其两两间不能相互攻击…

Input

一个数n

Output

第i行表示在第i行第几列放置皇后

Sample Input

4

Sample Output

2
4
1
3

HINT

100%的数据3<n<1000000。输出任意一种合法解即可

Source

题解：http://blog.csdn.net/nike0good/article/details/41006705

 #include<cstring>
 #include<cmath>
 #include<iostream>
 #include<algorithm>
 #include<cstdio>

 using namespace std;

 int n;

 int main()
 {
     scanf("%d",&n);
     if (n%!=&&n%!=)
     {
         for (int i=;i<=n;i+=)
             printf("%d\n",i);
         for (int i=;i<=n;i+=)
             printf("%d\n",i);
     }
     else
     {
         int k=n>>;
         if (k&)
         {
             for (int i=k;i<=n-;i+=)
                 printf("%d\n",i);
             for (int i=;i<=k-;i+=)
                 printf("%d\n",i);
             for (int i=k+;i<=n;i+=)
                 printf("%d\n",i);
             for (int i=;i<=k+;i+=)
                 printf("%d\n",i);
         }
         else
         {
             for (int i=k;i<=n;i+=)
                 printf("%d\n",i);
             for (int i=;i<=k-;i+=)
                 printf("%d\n",i);
             for (int i=k+;i<=n-;i+=)
                 printf("%d\n",i);
             for (int i=;i<=k+;i+=)
                 printf("%d\n",i);
         }
         if (n&)printf("%d\n",n);
     }
 }