算法训练 6-1 递归求二项式系数值

import java.util.Scanner;

public class Main {

    public static int Combination(int n ,int k){
        int result;
        if ( k == 0 || k == n){
            result = 1;
        }else{
            result = Combination(n-1, k)+Combination(n-1, k-1);
        }
        return result;
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int k = in.nextInt();
        int n = in.nextInt();
        System.out.print(Combination(n, k));
        in.close();
    }
}