Cod sursa(job #1781050)
Utilizator | Data | 16 octombrie 2016 17:39:34 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int DP[1005],n;
int fibo(int n)
{
if(n==0 || n==1) return 1;
if(!DP[n]) DP[n]=fibo(n-1)+fibo(n-2);
return DP[n];
}
int main()
{
fin>>n;
fout<<(fibo(n)%660634);
}