Cod sursa(job #1131626)
Utilizator | Data | 28 februarie 2014 22:27:06 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
long long N,mod,F[1000001],i;
int main()
{
ifstream fin("kfib.in");
ofstream fout("kfib.out");
mod=666013;
fin>>N;
F[1]=F[2]=1;
for(i=3;i<=N;i++)
{
F[i]=(F[i-1]+F[i-2])%mod;
}
fout<<F[N];
fin.close();
fout.close();
return 0;
}