[백준, BOJ 2775] 부녀회장이 될테야 (java)

출처-https://www.acmicpc.net/problem/2775

2775번: 부녀회장이 될테야

---

728x90

 

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		int arr[] = new int[t];
		
		for (int i=0; i<t; i++) {
			int k = scan.nextInt(); // 층
			int n = scan.nextInt(); // 호
			int dp[][] = new int[k+1][n+1];
			
			for (int j=1; j<=n; j++)
				dp[0][j] = j;
			
			for (int j=1; j<=k; j++) {
				for (int l=1; l<=n; l++)
					dp[j][l] = dp[j][l-1]+dp[j-1][l];
			}
			arr[i] = dp[k][n];
		}
		
		for (int i=0; i<t; i++)
			System.out.println(arr[i]);
	}

}