/**
* @param args
*/
public static void main(String[] args) {
// TODO 自动生成方法存根
Scanner in = new Scanner(System.in);
System.out.println("输入要显示的杨辉三角的行数");
int n = in.nextInt();
int i, j, a[][] = new int[n][];
for (i = 0; i < n; i++) {
a[i] = new int[i + 1];
a[i][i] = 1;
a[i][0] = 1;
}
for (i = 2; i < n; i++)
for (j = 1; j <= i - 1; j++)
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
for (i = 0; i < n; i++) {
for (int k = 0; k < n - i; k++) {
System.out.printf("%4s", " ");
}
for (j = 0; j <= i; j++) {
System.out.printf("%8d", a[i][j]);
}
System.out.println();
}
System.out.println();
}