找规律+模拟之 codevs 1160 蛇形矩阵-白红宇

找规律+模拟之 codevs 1160 蛇形矩阵

阅读量：5046 次

发布时间：2019-06-12

本文共 1549 字，大约阅读时间需要 5 分钟。

//  [10/11/2014 Sjm]/*(数组下标默认从 1 开始)经分析可知：令 myNode = ((n + 1) >> 1)，则： myArr[myNode][myNode] = 1^2	 myArr[myNode + 1][myNode + 1] = (1 + 2)^2	 myArr[myNode + 2][myNode + 2] = (3 + 2)^2	 …………	 据此可模拟生成过程。。。*/

1 #include 
     
       2 #include 
      
        3 #include 
       
         4 #include 
        
          5 #include 
         
           6 #include 
          
            7 #include 
           
             8 #include 
            
              9 #include 
             
              10 #include 
              
               11 #include 
               
                12 #include 
                13 using namespace std;14 #define eps 1e-815 #define MAX_LEN 10216 17 int n;18 int myArr[MAX_LEN][MAX_LEN];19 20 void Solve() {21 int val = 1;22 int myNode = ((n + 1) >> 1);23 myArr[myNode][myNode] = val * val;24 for (int i = myNode + 1; i <= n; ++i) {25 val += 2;26 myArr[i][i] = val * val;27 int northwest = myNode - (i - myNode);28 for (int j = 1; j < val; ++j) {29 myArr[i][i - j] = myArr[i][i] - j;30 }31 for (int j = 1; j < val; ++j) {32 myArr[i - j][northwest] = myArr[i][northwest] - j;33 }34 for (int j = 1; j < val; ++j) {35 myArr[northwest][northwest + j] = myArr[northwest][northwest] - j;36 }37 for (int j = 1; j < (val - 1); ++j) {38 myArr[northwest + j][i] = myArr[northwest][i] - j;39 }40 }41 int Sum = 0;42 for (int i = 1; i <= n; ++i) {43 for (int j = 1; j <= n; ++j) {44 printf("%d", myArr[i][j]);45 if (j != n) printf(" ");46 else printf("\n");47 if ((i == j) || (i + j == n + 1)) {48 Sum += myArr[i][j];49 }50 }51 }52 printf("%d\n", Sum);53 }54 55 int main() {56 scanf("%d", &n);57 Solve();58 return 0;59 }