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

#include <iostream>

using namespace  std;

int f(int k, int n){
    if (k == 0 || k == n)
        return 1;
    return f(k, n - 1) + f(k - 1, n - 1);

}

int main(){
    int n, k;
    cin >> k >> n;
    cout << f(k, n);
    return 0;
}