Cod sursa(job #1367755)
Utilizator | Data | 2 martie 2015 08:07:40 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("kfact.in");
ofstream g("kfact.out");
const int M=666013;
int k,x[1400000];
int main()
{
f>>k;
k=k%(2*M+2);
x[1]=1;
for(int i=2;i<=k;i++)
x[i]=(x[i-1]+x[i-2])%M;
g<<x[k]<<'\n';
g.close();
return 0;
}