[SWEA]파스칼의 삼각형(2005번, 자바)[D2]

import java.util.Scanner;


class Solution
{
	public static void main(String args[]) throws Exception
	{
		
		Scanner sc = new Scanner(System.in);
		int T;
		T=sc.nextInt();
		

		for(int test_case = 1; test_case <= T; test_case++)
		{
			
			int N=sc.nextInt();
			int[][]d=new int[N][N];
			
			d[0][0]=1;
			if(N>=2) {
				d[1][0]=1;
				d[1][1]=1;
			
				for(int i=2;i<N;i++) {
					d[i][0]=1;
					d[i][i]=1;
					for(int j=1;j<i;j++) {
						d[i][j]=d[i-1][j-1]+d[i-1][j];
					}
				}
			}
			
			System.out.println("#"+test_case);
			for(int i=0;i<N;i++) {
				for(int j=0;j<=i;j++) {
					System.out.print(d[i][j]+" ");
				}
				System.out.println();
			}
		}
	}
}