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