백준

[11050] 이항 계수 1

Jcoder 2018. 7. 23. 20:36


#include <iostream>
using namespace std;
int bin_coef_DC(int n, int k);
int main()
{
int n, k;
cin >> n >> k;
cout << bin_coef_DC(n, k) << endl;
return 0;
}
int bin_coef_DC(int n, int k)
{
if (k == 0 || k == n)
return 1;
else
return bin_coef_DC(n - 1, k - 1) + bin_coef_DC(n - 1, k);
}