Cod sursa(job #2353901)
Utilizator | Data | 24 februarie 2019 18:13:43 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
using namespace std;
#define NMax 100000000
int memo[NMax], n, result;
int fibbo(int n, int memo[])
{
if(memo[n])
return memo[n];
if(n == 1 || n == 2)
result = 1;
else
result = fibbo(n-1,memo) + fibbo(n-2,memo);
memo[n] = result;
return result;
}
int main()
{
cin >> n;
cout << fibbo(n, memo);
}