问题 1097: 蛇行矩阵

import java.util.Scanner;

public class Prog1097 {

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

int n = scan.nextInt();

int arr[][] = new int[n + 1][n + 1];

arr[0][0] = 1;

for (int i = 0; i < n; i++) {

arr[i + 1][0] = arr[i][0] + i + 1;

System.out.print(arr[i][0] + " ");

for (int j = 0; j < n - i - 1; j++) {

arr[i][j + 1] = arr[i][j] + i + j + 2;

if (j < n - 2 - i)

System.out.print(arr[i][j + 1] + " ");

else

System.out.print(arr[i][j + 1]);

}

System.out.println();

}

}

}