蛇形矩阵构造

#include <iostream>
#define max 10000
using namespace std;

int G[max][max];

int main()
{
    int n;
    cin>>n;
    int count;
    if(n%2==0)count=n/2;
    else count=n/2+1;
    int ans = 1;
    for(int t = 0;t < count;t++){
        for(int i = t;i < n-t;i++)
            G[t][i]=ans++;
        for(int j = t+1;j < n-t;j++)
            G[j][n-1-t]=ans++;
        for(int i = n-2-t;i>=t;i--)
            G[n-1-t][i]=ans++;
        for(int j = n-2-t;j>t&&ans<n*n;j--)
            G[j][t]=ans++;
    }

    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            cout<<G[i][j]<<" ";
        }
    }
    return 0;
}