#藍橋杯練習#蛇行矩陣

蛇行矩陣

主要是理解每一行每一列的遞增關係

#include <bits/stdc++.h>

using namespace std;

int main()
{
    //freopen("in.txt","r",stdin);
    int n;
    int i, j;
    int a[100][100];
    while(scanf("%d", &n) != EOF)
    {
        a[0][0] = 1;
        printf("%d", a[0][0]);
        for(i = 0; i < n - 1; i++)
        {
            a[i + 1][0] = a[i][0] + i + 1;
            for(j = 0; j < n - i - 1; j++)
            {
                a[i][j + 1] = a[i][j] + j + i + 2;
                printf(" %d", a[i][j + 1]);
            }
            printf("\n%d", a[i + 1][0]);
        }
        printf("\n");
    }
}