BZOJ3101 N皇后 [模拟]

N皇后方案输出。
找规律模拟即可。

#include<bits/stdc++.h>
using namespace std;
int main(){
    register int n, i;
    while(scanf("%d", &n)!=EOF){
        if(n%6!=2&&n%6!=3){
            for(i=2;i<=n;i+=2)printf("%d\n", i);
            for(i=1;i<=n;i+=2)printf("%d\n", i);
        }else{
            if((n/2)%2==0){
                for(i=n/2;i<=n;i+=2)printf("%d\n",i);
                for(i=2;i<=n/2-1;i+=2)printf("%d\n",i);
                for(i=n/2+3;i<=n-1;i+=2)printf("%d\n",i);
                for(i=1;i<=n/2+1;i+=2)printf("%d\n",i);
            }else{
                for(i=n/2;i<=n-1;i+=2)printf("%d\n",i);
                for(i=1;i<=n/2-1;i+=2)printf("%d\n",i);
                for(i=n/2+3;i<=n;i+=2)printf("%d\n",i);
                for(i=2;i<=n/2+1;i+=2)printf("%d\n",i);
            }
            if(n%2==1)printf("%d\n",n);
        }
    }
    return 0;
}