Cod sursa(job #1599057)
| Utilizator | Data | 13 februarie 2016 16:17:16 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#define m 666013
#define maxn 2 * m + 10
using namespace std;
ifstream in("kfib.in");
ofstream out("kfib.out");
int f[maxn];
int fib(int n)
{ f[0]=1; f[1]=1; f[2]=1;
for(int i = 3; i <= n; i++)
f[i] = (f[i-1] + f[i-2]) % m;
return f[n] ;
}
int main()
{ int n;
in >> n;
n = n % (m * 2 + 2);
out << fib(n);
return 0;
}
