/*******************************************************************
 * Julius C demo case: binomial computation usig dynamic programming
 * -- author Paolo D'Alberto 
 *
 * Even though the algorithm is a simple divide ad conquer algorithm,
 * JuliusC allows to reuse computations, therefore reuse.
 */


#define JC
#ifndef JC 
#include <stdio.h>
#define putln(x) printf("%c \n",x);
#define put(x) printf("%d ",x);
#define getln(x) scanf("%d",&x);
#define get(x) scanf("%d",&x);
#endif

int main() { 

  int n,k;
 
  putln('n');
  n=10;
  put(n); putln(' ');
  putln(' ');
  putln('k');
  k=5;
  putln(k);
  putln(' ');
  
  put(bin(n,k));
  return 1;
}

int bin(int n, int k) { 

  if (k==0 || n==k) 
    return 1;
  else 
    return bin(n-1,k-1)+bin(n-1,k);
}