【蓝桥杯】算法训练 6-1 递归求二项式系数值

#include <iostream>
using namespace std;

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;
}

int main(){
int k,n;

cin >> k;
cin >> n;
int result = Combination(n,k);
cout << result;
return 0;
}