0
Your rating: None
CodeChef submission 796720 (C) 

CodeChef submission 796720 (C) plaintext list. Status: CE, problem AVISKR02, contest . By pvihari (pvihari), 2012-01-16 20:09:26.
  1. #include<stdio.h>
  2.  
  3. #define Max 10000000000
  4.  
  5. int fibonacci[Max];
  6. long int i;
  7. long int getG(long int n);
  8. long int fib(long int m);
  9.  
  10. int main(){
  11.   int cases;
  12.   long int n;
  13.   int j;
  14.   long int g;
  15.  
  16.   for(i=0;i<Max;i++)
  17.     fibonacci[i] = -1;
  18.   fibonacci[1] = 1;
  19.   fibonacci[2] = 1;
  20.  
  21.   scanf("%d",&cases);
  22.  
  23.   for(j=0;j<cases;j++){
  24.     scanf("%ld",&n);
  25.     g = getG(n);
  26.     printf("%ld\n",g%1000000007);
  27.   }
  28.   return 0;
  29. }
  30.  
  31. long int getG(long int n){
  32.   long int sum = 0;
  33.   for(i=1;i<=n;i++)
  34.     sum = sum+fib(4*i-1);
  35.   return(sum);
  36. }
  37.  
  38. long int fib(long int i){
  39.   if((fibonacci[i]>0)||(i==1)||(i==2))
  40.     return(fibonacci[i]);
  41.   fibonacci[i] = fib(i-1)+fib(i-2);
  42.   //  printf("f %ld %d\n",i,fibonacci[i]);
  43.   return(fibonacci[i]);
  44. }
  45.

Comments