Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int fib(int n)
- {
- return n==0 ? 0 : n == 1 ? 1 : fib(n-1) + fib(n-2);
- }
- int main()
- {
- int n;
- unsigned long long int seka[81];
- cin >> n;
- for(int i = 0;i<=n;i++){
- if(i==0){
- seka[i]=0;
- }
- else if(i==1){
- seka[i]=1;
- }
- else{
- seka[i] = seka[i-1] + seka[i-2];
- }
- }
- cout << seka[n];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement