Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int arr[1000];
- int fib(int);
- int main()
- {
- int t,n,i;
- cin >> t;
- for(i=1;i<=t;i++)
- {
- cin>> n;
- if(n>=0 && n<=60)
- {
- memset(arr,-1,sizeof(arr));
- printf("Fib(%d) = %d\n",n,fib(n));
- }
- }
- return 0;
- }
- int fib(int n)
- {
- if(n<=1) return n;
- if(arr[n]!=-1) return arr[n];
- else
- {
- arr[n]=fib(n-1)+fib(n-2);
- return arr[n];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement