蛇形填数

 1 #include<iostream>
 2 #include<string.h>
 3 #include<iomanip>
 4 using namespace std;
 5 #define maxn 10
 6 int a[maxn][maxn];
 7 int main() {
 8     int x, y, n, tot=1;
 9     cin >> n;
10     memset(a, 0, sizeof(a)); //将数组元素全部填充为0
11     a[x = 0][y = n - 1] = tot;
12     while (tot < n*n) {
13         while (x + 1 < n && !a[x+1][y]) a[++x][y] = ++tot;  //移动坐标并判断将要填入数值的元素是否已经填入其他非0数值
14         while (y - 1 >=0 && !a[x][y-1]) a[x][--y] = ++tot;
15         while (x - 1 >=0 && !a[x-1][y]) a[--x][y] = ++tot;
16         while (y + 1 < n && !a[x][y+1]) a[x][++y] = ++tot;
17     }
18     for (x = 0; x < n; x++) {
19         for (y = 0; y < n; y++)
20             cout <<setw(6)<< a[x][y];
21         cout << endl;    
22     }
23     return 0;
24 }