Find Binomial Coefficient

-

// A Dynamic Programming based solution that uses 
// table C[][] to calculate the Binomial Coefficient
#include<bits/stdc++.h>
using namespace std;
 
// Prototype of a utility function that
// returns minimum of two integers
int min(int a, int b);
 
// Returns value of Binomial Coefficient C(n, k)
int binomialCoeff(int n, int k)
{
    int C[n + 1][k + 1];
    int i, j;
 
    // Caculate value of Binomial Coefficient
    // in bottom up manner
    for (i = 0; i <= n; i++)
    {
        for (j = 0; j <= min(i, k); j++)
        {
            // Base Cases
            if (j == 0 || j == i)
                C[i][j] = 1;
 
            // Calculate value using previously
            // stored values
            else
                C[i][j] = C[i - 1][j - 1] +
                          C[i - 1][j];
                          // ncr formula-> (n)c(r)= (n-1)c(r)+(n-1)c(r-1) if r=0,r=n then ncr=1
        }
    }
 
    return C[n][k];
}
 
// A utility function to return 
// minimum of two integers
int min(int a, int b)
{
    return (a < b) ? a : b;
}
 
// Driver Code
int main()
{
    int n = 5, k = 2;
    cout << "Value of C[" << n << "]["
         << k << "] is " << binomialCoeff(n, k);
}
 

Comments

Post a Comment

Popular posts from this blog

-
// sieve of Atkin is a popular way to find all the prime numbers in range using the dp approach and is //better than the erronthesis approach // C++ program for implementation of Sieve of Atkin #include <bits/stdc++.h> using namespace std;   int SieveOfAtkin(int limit) {     // 2 and 3 are known to be prime     if (limit > 2)         cout << 2 << " ";     if (limit > 3)         cout << 3 << " ";       // Initialise the sieve array with false values     bool sieve[limit];     for (int i = 0; i < limit; i++)         sieve[i] = false;     for (int x = 1; x * x < limit; x++) {         for (int y = 1; y * y < limit; y++) {                           // Main part of Sieve of Atkin       ...
Read more

Stack - print bracket number

-
/ * example 2 (0+1)*0(0+1)*0(0+1)* (1*0)*1* o/p 1 1 2 2 3 3  1 1  Example: Input: 3 (a+(b*c))+(d/e) ((())(())) ((((() Output: 1 2 2 1 3 3 1 2 3 3 2 4 5 5 4 1 1 2 3 4 5 5 */ #include<bits/stdc++.h> using namespace std; int main()  { int t; cin>>t; while(t--) {     string s;     stack <int> st;     int c=0; // we maintain the count of open brackets     cin>>s;     for(int i=0;i<s.length();i++)     {         if(s[i]=='(')         {c++;         cout<<c<<" ";         st.push(c);         }         if(s[i]==')')         {             cout<<st.top()<<" ";             st.pop();         } ...
Read more

Codeforces Minimum subscribers in a window

-
/*  TV Subscriptions (Hard Version) time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The only difference between easy and hard versions is constraints. The BerTV channel every day broadcasts one episode of one of the  k k  TV shows. You know the schedule for the next  n n  days: a sequence of integers  a 1 , a 2 , … , a n a 1 , a 2 , … , a n  ( 1 ≤ a i ≤ k 1 ≤ a i ≤ k ), where  a i a i  is the show, the episode of which will be shown in  i i -th day. The subscription to the show is bought for the entire show (i.e. for all its episodes), for each show the subscription is bought separately. How many minimum subscriptions do you need to buy in order to have the opportunity to watch episodes of purchased shows  d d  ( 1 ≤ d ≤ n 1 ≤ d ≤ n ) days in a row? In other words, you want to buy the minimum number of TV shows so that there is some segm...
Read more