fork(2) download
copy 
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <math.h>
  4. #include <stdlib.h>
  5. #define mod 1000000007
  6. int min(int a, int b)
  7. {
  8.     return (a<b)? a: b;
  9. }
  10. int binomialCoeff(int n, int k)
  11. {
  12.     int C[n+1][k+1];
  13.     int i, j;
  14.  
  15.  
  16.     for (i = 0; i <= n; i++)
  17.     {
  18.         for (j = 0; j <= k; j++)
  19.         {
  20.  
  21.             if (j == 0 || j == i)
  22.                 C[i][j] = 1;
  23.  
  24.  
  25.             else
  26.                 C[i][j] = ((C[i-1][j-1])%mod +( C[i-1][j])%mod)%mod;
  27.         }
  28.     }
  29.  
  30.     return C[n][k];
  31. }
  32. int main()
  33.     {
  34.     int i,t,ans,m,n;
  35.     scanf("%d",&t);
  36.     for(i=0;i<t;i++)
  37.         {
  38.         scanf("%d%d",&n,&m);
  39.         ans= binomialCoeff(n+m-1,n);
  40.         printf("%d\n",ans);
  41.     }
  42. }
Success #stdin #stdout 0s 9416KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/knhd1k
language:
C (gcc 8.3)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!