-
Notifications
You must be signed in to change notification settings - Fork 34
/
D.java
43 lines (38 loc) · 1.26 KB
/
D.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
import java.io.PrintStream;
import java.util.*;
/**
* Codejam to I/O for Women 2015 Problem D: Googlander
* Check README.md for explanation.
*/
public class Main {
private String solve(Scanner scanner) {
int r=scanner.nextInt(), c=scanner.nextInt();
long[][] dp=new long[r+1][c+1];
for (int i=1;i<=c;i++)
dp[1][i]=1;
for (int i=1;i<=r;i++)
dp[i][1]=1;
for (int i=2;i<=r;i++) {
for (int j=2;j<=c;j++) {
dp[i][j]=1;
for (int x=2;x<=i;x++) {
for (int y=2;y<=j;y++) {
dp[i][j]+=dp[x-1][y-1];
}
}
}
}
return String.valueOf(dp[r][c]);
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}