蓝桥杯训练 蛇形矩阵 模拟

#include<iostream>
using namespace std;

int n;
int a[110][110];
int main()
{
    while (cin >> n){
        int sum = 0;
        int tot = n;
        int t = 1;
        while (tot--){
            
                for (int i = sum; i >=0; i--)
                    a[i][sum - i] = t++;

            sum++;
        }
        //输出
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n - i; j++){
                if (j == n - i - 1)
                    cout << a[i][j];
                else 
                    cout << a[i][j] << ‘ ‘;
            }
            cout << endl;
        }
    }
    return 0;
}