Advertisement
Guest User

Untitled

a guest
Oct 25th, 2014
125
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.36 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. long long arr[31][3] = {0};
  5.  
  6. long long fib(int n, int k)
  7. {
  8.    if(n == 0) return 1;
  9.    if(arr[n][k] != 0) return arr[n][k];
  10.    if(k == 2) arr[n][k] = fib(n-1,0);
  11.    else
  12.    arr[n][k] = fib(n-1,0)+fib(n-1,k+1);
  13.    return arr[n][k];
  14. }
  15.  
  16. int main() {
  17.    int n;
  18.    cin>>n;
  19.    cout<<fib(n,0)<<endl;
  20.    return 0;
  21. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement