Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- // Retorna el minimo de 2 enteros
- int min(int a, int b);
- // Retorna el valor del coeficiente binomial C(n, k)
- int binomialCoeff(int n, int k)
- {
- int C[n+1][k+1];
- int i, j;
- // Usamos la estrategia bottom up
- for (i = 0; i <= n; i++)
- {
- for (j = 0; j <= min(i, k); j++)
- {
- // Casos base
- if (j == 0 || j == i)
- C[i][j] = 1;
- // Usando los valores previamente calculados
- else
- C[i][j] = C[i-1][j-1] + C[i-1][j];
- }
- }
- return C[n][k];
- }
- //Funcion minimo
- int min(int a, int b)
- {
- return (a<b)? a: b;
- }
- int main()
- {
- int n = 5, k = 2;
- printf ("Valor de C(%d, %d) is %d ", n, k, binomialCoeff(n, k) );
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement