Fibbonacci Number
f(0) = 0
f(1) = 1
f(n) = f(n-1) + f(n-2)
Your program should be able to handle values of n in the range 0 to 50.
Output
3 4 5 -1
2 3 5you can use 64bit integer: __int64HintNote:
//打表(AC)
#include<stdio.h>
__int64 n[56]={0,1};
void f()
{
for(int i=2;i<=55;i++)
{
n[i]=n[i-1]+n[i-2];
}
}
int main()
{ f();
int a;
while(scanf("%d",&a)&&a!=-1)
{
printf("%I64d\n",n[a]);
}
return 0;
}
//普通(AC)
#include<stdio.h>
int main()
{
int n,i;
__int64 s[100000];
while(scanf("%d",&n)&&n!=-1)
{
s[0]=0;
s[1]=1;
for(i=2;i<=n;i++)
{
s[i]=s[i-1]+s[i-2];
}
printf("%I64d\n",s[n]);
}
return 0;
}
//超时
#include<stdio.h>
__int64 f(int i)
{
if(i==0) return 0;
else if(i==1) return 1;
else return f(i-1)+f(i-2);
}
int main()
{
__int64 f(int i);
int a;
while(scanf("%d",&a)&&a!=-1)
{
printf("%I64d\n",f(a));
}
return 0;
}