杨辉三角（HDUOJ）——Java

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int n = sc.nextInt();
			int[][] arr = new int[n][n];
			for(int i = 0;i < arr.length;i++) {
				arr[i][i] = 1;
				arr[i][0] = 1;
			}
			for(int i = 2;i < arr.length;i++) {
				for(int j = 1;j < i;j++) {
					arr[i][j] = arr[i-1][j-1] + arr[i-1][j];
				}
			}
			for(int i = 0;i < arr.length;i++) {
				for(int j = 0;j <= i;j++) {
					System.out.print(arr[i][j]);
					if(i != j) {
						System.out.print(" ");
					}
					}
				System.out.println();
				if(i == arr.length-1) {
					System.out.println();
				}
				
			}
		}
		sc.close();
	}
}