1130: 杨辉三角
import java.util.Scanner;
public class Main {
static Scanner cin = new Scanner(System.in);
static int [][]a=new int[31][31];
public static void main(String[] args) {
a[1][1]=1;
int n=cin.nextInt();
for(int i=2;i<=n;i++)
for(int j=1;j<=i;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
}
}