Cod sursa(job #1807012)
| Utilizator | Data | 15 noiembrie 2016 21:55:28 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
const int MOD = 666013;
const int P = 1332028; //Perioada modulo MOD
ifstream f("kfib.in");
ofstream g("kfib.out");
int Fibonacci(int n)
{
int f0 = 0, f1 = 1;
for(int i = 2; i <= n; i++)
{
int f2 = (f0 + f1) % MOD;
f0 = f1;
f1 = f2;
}
return f1;
}
int main()
{
int N;
f >> N;
g << Fibonacci(N % P);
f.close();
g.close();
return 0;
}
