Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20277 Accepted Submission(s): 9444
Problem Description
Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:
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.
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.
Input
Each test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.
Output
Print out the answer in a single line for each test case.
Sample Input
3 4 5 -1
Sample Output
2 3 5you can use 64bit integer: __int64HintNote:
Author
Lily
Source
Recommend
第一次使用__int64 m,n;(定义数据类型) %I64d(键入与输出的格式)
#include<stdio.h>
#include<algorithm>
#define G 55
using namespace std;
int main() {
int t,n;
__int64 wqs[G]= {0,1,1,2,3,5,8};
while(scanf("%d",&n)&&(n!=-1)) {
for(int j=7; j<=n; j++)
wqs[j]=wqs[j-1]+wqs[j-2];
printf("%I64d\n",wqs[n]);
}
return 0;
}
/**********测试数据**************
*********************************/