Cod sursa(job #3338057)
| Utilizator | Data | 31 ianuarie 2026 11:31:10 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int f[1400000], n, k;
int main()
{
f[0] = 0; f[1] = 1; f[2] = 1;
n = 2;
while (!(f[n-1] == 0 && f[n] == 1))
{
n++;
f[n] = (f[n-1] + f[n-2]) % MOD;
}
n--;
fin >> k;
fout << f[k % n] << "\n";
return 0;
}
