1160 蛇形矩阵

#include<iostream>
using namespace std;

class pos {
public:
    int x;
    int y;

};


int a[105][105] = { 0 };

int main()
{
    pos p[4];
    p[0].x = -1;
    p[0].y = 0;
    p[1].x = 0;
    p[1].y = -1;
    p[2].x = 1;
    p[2].y = 0;
    p[3].x = 0;
    p[3].y = 1;
    int T, t, x, y;
    cin >> T;
    int sum = T*T;
    t = 0;
    x = T;
    y = T;
    a[T][T] = sum--;
    for (; sum > 0; sum--) {
        if (a[x + p[t % 4].x][y + p[t % 4].y] == 0 && x + p[t % 4].x > 0 && x + p[t % 4].x <= T && y + p[t % 4].y > 0 && y + p[t % 4].y <= T )
            a[x += p[t % 4].x][y += p[t % 4].y] = sum;
        else {
            t++;
            a[x += p[t % 4].x][y += p[t % 4].y] = sum;
        }
    }
    for (int i = 1; i <= T; i++)
    {
        for (int j = 1; j <= T; j++)
            cout << a[j][i]<<" ";
        cout << endl;
    }
    for (int i = 1; i <= T; i++)
        sum += a[i][i]+a[i][T-i];
    cout << sum << endl;
    return 0;
}