[백준] 11050번 이항 계수 1 #Java

 

import java.util.*;

public class Main {

    static int [][] dp = new int[100][100];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        System.out.println(solution(n, m));
    }

    private static int solution(int n, int m) {
        if(dp[n][m]>0) return dp[n][m];
        else if(n==m || m == 0) return 1;
        else return dp[n][m] = solution(n-1,m-1) + solution(n-1,m);
    }

}