/ Published in: C++
implementation of binom coefficient dynamic programming c++
Expand |
Embed | Plain Text
#include <iostream> using namespace std; int min(int i,int k){ if (i<k) return i; return k; } int binomni(int n, int k){ int C[n+1][k+1]; //C[n][0]=C[n][n]=1; for(int i=0; i<=n; i++) for (int j=0;j<=min(i,k);j++){ if(j==0 || i==j) C[i][j]=1; else C[i][j]=C[i-1][j-1] + C[i-1][j]; } return C[n][k]; } int main(){ int n,k; cout << "Unesite n: "; cin >> n; cout << "Unesite k: "; cin >> k; cout << "\nBinomni koeficijent iznosi: " << binomni(n,k) << endl; cin >> n; return 0; }
You need to login to post a comment.
