Pagini recente » Borderou de evaluare (job #1360204) | Borderou de evaluare (job #1273848) | Borderou de evaluare (job #1333194) | Borderou de evaluare (job #2610469) | Cod sursa (job #3338055)
#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;
}