九度[1140]八皇后 

 1 # include<iostream>
 2 # include<cstring>
 3 # include<algorithm>
 4 # include<cmath>
 5 using namespace std;
 6 int b[100];
 7 int k=0;
 8 int c[9];
 9 void search(int cur,int sum)
10 {
11     if(cur==9) b[k++]=sum;
12     else
13     {
14         for(int i=1;i<9;i++)
15         {
16             int ok=1;
17             c[cur]=i;
18             for(int j=1;j<cur;j++)
19             {
20                 if(c[cur]==c[j] || cur-c[cur]==j-c[j] || cur+c[cur]==j+c[j])
21                 {
22                     ok=0;
23                     break;
24                 }
25             }
26             if(ok) 
27             {
28                 search(cur+1,sum+pow(10.0,8-cur)*i);
29             }
30         }
31     }
32 }
33 
34 int main()
35 {
36     int n=0;
37     memset(b,0,sizeof(b));
38     memset(c,0,sizeof(c));
39     search(1,0);
40     sort(b,b+92);
41     while(cin>>n)
42     {
43         while(n--)
44         {
45             int k=0;
46             cin>>k;
47             cout<<b[k-1]<<endl;
48         }
49     }
50     return 0;
51 }

 

posted @ 2016-02-20 16:36  dreamer123  阅读(168)  评论(0)  编辑  收藏  举报