-
Notifications
You must be signed in to change notification settings - Fork 8
/
Main2.java
65 lines (44 loc) · 1.47 KB
/
Main2.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* BOJ#1010 다리 놓기
* https://www.acmicpc.net/problem/1010
*/
public class Main2 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int T = Integer.parseInt(br.readLine());
while (T-- > 0) {
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
// dp[N][M] = dp[N-1][M-1] + dp[N-1][M-2] + .. + dp[N-1][N-1]
long[][] dp = new long[N + 1][M + 1];
for (int i = 0; i < N + 1; i++) {
Arrays.fill(dp[i], 0L);
}
for (int i = 0; i < M + 1; i++) {
dp[1][i] = i;
}
if (N == M) {
System.out.println(1);
continue;
}
if (N == 1) {
System.out.println(dp[1][M]);
continue;
}
for (int i = 2; i <= N; i++) {
for (int j = i; j <= M; j++) {
for (int k = i - 1; k < j; k++) {
dp[i][j] += dp[i - 1][k];
}
}
}
System.out.println(dp[N][M]);
}
}
}