蓝桥杯 九宫幻方(枚举全排列)

 1 #include<iostream>
 2 #include<cstring>
 3 #include<algorithm>
 4 
 5 using namespace std;
 6 
 7 int a[9] = {1,2,3,4,5,6,7,8,9};    // 进行枚举的全排列数组 
 8 int b[9];    // 一开始输入的3×3数组 
 9 int result[9];    // 保存结果的数组 
10 
11 int main()
12 {
13     for(int i = 0; i < 9; ++i)
14             cin >> b[i];
15             
16     int cnt = 0;
17     do
18     {
19         int flag = 1;
20         for(int i = 0; i < 9; ++i)
21         {
22             if(b[i] != 0)
23             {
24                 if(a[i] != b[i])
25                 {
26                     flag = 0;
27                     break;
28                 }    
29             }
30         }
31         
32         if(flag == 0)
33             continue;
34         else
35         {
36                 int sum1 = a[0] + a[1] + a[2];
37                 int sum2 = a[0] + a[3] + a[6];
38                 int sum3 = a[6] + a[7] + a[8];
39                 int sum4 = a[2] + a[5] + a[8];
40                 int sum5 = a[0] + a[4] + a[8];
41                 int sum6 = a[2] + a[4] + a[6];
42                 if(sum1 == sum2 && sum2 == sum3 && sum3 == sum4 && sum4 == sum5 && sum5 == sum6)
43                 {
44                     memcpy(result, a,sizeof(a));
45                     cnt++;
46                 }                    
47         }
48     
49     }while(next_permutation(a,a+9));    
50     
51     if(cnt == 1)
52     {
53         for(int i = 0; i < 9; ++i)
54         {
55             if(i % 3 == 2)
56                 cout << result[i] << endl;
57             else
58                  cout << result[i] << ‘ ‘;    
59         } 
60     }
61     else
62         cout << "Too Many" << endl;
63     
64     return 0;
65 }