BEAKJOON JAVA ALGORITHM #1010(다리놓기)

https://www.acmicpc.net/problem/1010

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class a1010 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int num=Integer.parseInt(br.readLine()); for(int i=0;i<num;i++){ StringTokenizer token=new StringTokenizer(br.readLine()); int n=Integer.parseInt(token.nextToken()); int m=Integer.parseInt(token.nextToken()); int[][] arr=new int[n+1][m+1]; for(int j=1;j<=m;j++){ arr[1][j]=j; } for(int j=2;j<=n;j++){ for(int p=j;p<=m;p++){ for(int q=p;q>=j;q--){ arr[j][p]+=arr[j-1][q-1]; } } } System.out.println(arr[n][m]); } } }