杨辉三角形
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner b=new Scanner(System.in);
int n = b.nextInt();
int a[][]=new int[n][n];
for (int i=0;i<n;i++){
a[i][0]=a[i][i]=1;
if (i>0){
for (int j=1;j<i;j++){
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
for (int k=0;k<=i;k++){
System.out.print(a[i][k]+" ");
}
System.out.println();
}
}
}