杨辉三角

杨辉三角

	public static void main(String[] args) {
			Scanner in = new Scanner(System.in);	
			int n = in.nextInt();
			int[][] a = new int [35][35];
			for (int i=1; i<=n; i++) {	
	       		for(int j=1; j<=i; j++) {	
	       			if (j==1 || i==j) a[i][j]=1;	
	       			else a[i][j] = a[i-1][j-1] + a[i-1][j];	
	       			System.out.print(a[i][j]+" ");	
	       			}		
	       		System.out.println();
	       		}