/*
  Calcul des 40 premiers nombres de Fibonaci.
  Author: O. Coulaud
  

 */

long comp_fib_numbers(int n){
  //
  // Basic algorithm: f(n) = f(n-1) + f(n-2)
  //
  long  fnm1, fnm2, fn;
  if ( n == 0 || n == 1 ) return(n);

  fnm1 = comp_fib_numbers(n-1);

  fnm2 = comp_fib_numbers(n-2);

  fn   = fnm1 + fnm2; 
  return(fn) ;
}

int main(){
  long result ;
  int n = 40;
  int nthreads;


  result = comp_fib_numbers(n);



  printf("Result for n = %d: %ld \n",n,result);
}