Cod sursa(job #1615600)
| Utilizator | Data | 26 februarie 2016 18:16:35 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("kfib.in");
ofstream out("kfib.out");
int v[1000000];
int fib(int n) {
if(v[n]!=0)
return v[n];
if(n == 1 || n == 2)
return 1;
v[n]=(fib(n-1)+fib(n-2))%666013;
return v[n];
}
int main()
{
int n;
in>>n;
out<<fib(n)%666013;
return 0;
}
