Solution to the n Queens Puzzle

给你一个n*n的矩阵，现在输出一个解8<=n<=30;

普通的dfs会超时，在这里直接举例找数学规律。

一、当n mod 6 != 2 或 n mod 6 != 3时：

[2,4,6,8,...,n],[1,3,5,7,...,n-1]        (n为偶数)

[2,4,6,8,...,n-1],[1,3,5,7,...,n ]       (n为奇数)

二、当n mod 6 == 2 或 n mod 6 == 3时

(当n为偶数,k=n/2；当n为奇数,k=(n-1)/2)

[k,k+2,k+4,...,n],[2,4,...,k-2],[k+3,k+5,...,n-1],[1,3,5,...,k+1]         (k为偶数,n为偶数)

[k,k+2,k+4,...,n-1],[2,4,...,k-2],[k+3,k+5,...,n-2],[1,3,5,...,k+1],[n]     (k为偶数,n为奇数)

[k,k+2,k+4,...,n-1],[1,3,5,...,k-2],[k+3,...,n],[2,4,...,k+1]              (k为奇数,n为偶数)

[k,k+2,k+4,...,n-2],[1,3,5,...,k-2],[k+3,...,n-1],[2,4,...,k+1],[n ]      (k为奇数,n为奇数)

/*代码一：构造法*/

//Memory Time 
//188K   16MS 

#include<iostream>
#include<cmath>
using namespace std;

int main(int i)
{
    int n;  //皇后数
    while(cin>>n)
    {
        if(!n)
            break;

        if(n%6!=2 && n%6!=3)
        {
            if(n%2==0)  //n为偶数
            {
                for(i=2;i<=n;i+=2)
                    cout<<i<<' ';
                for(i=1;i<=n-1;i+=2)
                    cout<<i<<' ';
                cout<<endl;
            }
            else   //n为奇数
            {
                for(i=2;i<=n-1;i+=2)
                    cout<<i<<' ';
                for(i=1;i<=n;i+=2)
                    cout<<i<<' ';
                cout<<endl;
            }
        }
        else if(n%6==2 || n%6==3)
        {
            if(n%2==0)  //n为偶数
            {
                int k=n/2;
                if(k%2==0)  //k为偶数
                {
                    for(i=k;i<=n;i+=2)
                        cout<<i<<' ';
                    for(i=2;i<=k-2;i+=2)
                        cout<<i<<' ';
                    for(i=k+3;i<=n-1;i+=2)
                        cout<<i<<' ';
                    for(i=1;i<=k+1;i+=2)
                        cout<<i<<' ';
                    cout<<endl;
                }
                else  //k为奇数
                {
                    for(i=k;i<=n-1;i+=2)
                        cout<<i<<' ';
                    for(i=1;i<=k-2;i+=2)
                        cout<<i<<' ';
                    for(i=k+3;i<=n;i+=2)
                        cout<<i<<' ';
                    for(i=2;i<=k+1;i+=2)
                        cout<<i<<' ';
                    cout<<endl;
                }
            }
            else   //n为奇数
            {
                int k=(n-1)/2;
                if(k%2==0)  //k为偶数
                {
                    for(i=k;i<=n-1;i+=2)
                        cout<<i<<' ';
                    for(i=2;i<=k-2;i+=2)
                        cout<<i<<' ';
                    for(i=k+3;i<=n-2;i+=2)
                        cout<<i<<' ';
                    for(i=1;i<=k+1;i+=2)
                        cout<<i<<' ';
                    cout<<n<<endl;
                }
                else  //k为奇数
                {
                    for(i=k;i<=n-2;i+=2)
                        cout<<i<<' ';
                    for(i=1;i<=k-2;i+=2)
                        cout<<i<<' ';
                    for(i=k+3;i<=n-1;i+=2)
                        cout<<i<<' ';
                    for(i=2;i<=k+1;i+=2)
                        cout<<i<<' ';
                    cout<<n<<endl;
                }
            }
        }
    }
    return 0;
}