[백준-2775번/Java] 부녀회장이 될테야

* 다이나믹 프로그래밍 (DP)

import java.io.*;
import java.util.*;

public class Main {

	public static void main(String[] args) throws IOException {

		Scanner scan = new Scanner(System.in);

		int[][] arr = new int[15][15];

		for (int i = 0; i < 15; i++) {
			arr[i][0] = i + 1;
		}

		for (int i = 1; i < 15; i++) {
			for (int j = 0; j < 15; j++) {
				if (j == 0) {
					arr[j][i] = 1;
				} else if (j > 0) {
					arr[j][i] = arr[j - 1][i] + arr[j][i - 1];
				}
			}
		}
		int N = scan.nextInt();

		for (int i = 0; i < N; i++) {
			int h = scan.nextInt();
			int w = scan.nextInt() - 1;
			if (w >= 0) {
				System.out.println(arr[w][h]);
			}
		}
		
		scan.close();

	}

}