HDU-2032-杨辉三角

import java.io.*;import java.util.*;public class Q_2032 {public static void main(String args[]){Scanner in = new Scanner(new BufferedInputStream(System.in));while(in.hasNext()){int n = in.nextInt();int a[][] = new int[n][n];if(n ==1){System.out.println("1");}else if(n == 2){System.out.println("1");System.out.println("1 1");}else{a[1][0] = 1;a[1][1] = 1;System.out.println("1");System.out.println("1 1");for(int i = 2;i<n;i++){for(int j = 0;j<=i;j++){if(j == 0){a[i][j] = 1;System.out.print(1);}else if(j == i){a[i][j] = 1;System.out.println(" 1");}else{a[i][j] = a[i-1][j-1] +a[i-1][j];System.out.print(" "+a[i][j]);}}}}System.out.println();}}}