Cod sursa(job #1994831)
Utilizator | Data | 26 iunie 2017 11:46:02 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define MAXN 100
using namespace std;
ifstream in("fib.in");
ofstream out("fib.out");
long int PD(long int n) {
int D[n+1] = {0};
if (n <= 1) {
return n;
}
if (D[n] == 0) {
D[n] = PD(n-1) + PD(n-2);
}
return D[n];
}
int main()
{
long int n;
in>>n;
out<<PD(n);
return 0;
}