Pagini recente » Cod sursa (job #2477387) | Cod sursa (job #3176440) | Cod sursa (job #2494241) | Cod sursa (job #1513520) | Cod sursa (job #1608431)
#include <bits/stdc++.h>
#define P 666013
using namespace std;
int a[1500001], n, k;
int main()
{
bool ok;
a[1] = a[2] = 1;
a[3] = 2;
n = 3;
ok = false;
while (!ok)
{
n++;
a[n] = a[n - 1] + a[n - 2];
if (a[n] >= P) a[n] -= P;
if (a[n] == 1 && a[n - 1] == 0) ok = true;
}
n--;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
fin >> k;
k %= n;
fout << a[k] << "\n";
fout.close();
fin.close();
return 0;
}