- 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.
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
- 5
- #include <algorithm>
- #include <iostream>
- #include <cstring>
- #include <cstdio>
- #include <vector>
- #include <cmath>
- #include <queue>
- #include <deque>
- #include <cmath>
- #include <map>
- using namespace std;
- typedef long long ll;
- #define INF 0x7fffffff
- const double inf=1e20;
- const int maxn=1e5+10;
- const int mod=1e9+7;
- ll a[60];
- int main() {
- a[0]=0;
- a[1]=1;
- for(int i=2;i<55;i++){
- a[i]=a[i-1]+a[i-2];
- }
- int n;
- while(scanf("%d",&n)!=EOF){
- if(n==-1)break;
- printf("%lld\n",a[n]);
- }
- return 0;
- }
来源: http://www.bubuko.com/infodetail-3456339.html