Cod sursa(job #1458326)
Utilizator | Data | 7 iulie 2015 12:54:03 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#define MOD 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int n;
unsigned long long fibo[4000000];
int main()
{
f>>n;
fibo[0]=0;
fibo[1]=1;
for (int i=2; i<=n; ++i) fibo[i]=(fibo[i-1]+fibo[i-2])%MOD;
g<<fibo[n]<<'\n';
f.close();
g.close();
return 0;
}