（Java）杨辉三角

public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[][] array = new int[n][n];
        array[0][0] = 1;
        for (int i = 1; i < n; i++){
            array[i][0] = 1;
            for (int j = 1; j < n; j++){
                array[i][j] = array[i-1][j-1] + array[i-1][j];
            }
        }
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++){
                System.out.print(array[i][j]);
            }
            System.out.println();
        }
    }