hdu Fibonacci

 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 using namespace std;

 int f[],n;

 int main()
 {
     f[]=;
     f[]=;
     for(int i=; i<; i++)
     {
         f[i]=f[i-]+f[i-];
     }
     while(scanf("%d",&n)!=EOF)
     {
         if(n<=)
         {
             printf("%d\n",f[n]);
             continue;
         }
         else
         {
             double m=-0.5*log(5.0)/log(10.0)+((double)n)*log((sqrt(5.0)+1.0)/2.0)/(log(10.0));
             m-=floor(m);
             m=pow(10.0,m);
             while(m<)
             {
                 m*=;
             }
             printf("%d\n",(int)m);
         }
     }
     return ;
 }