Pagini recente » Cod sursa (job #2640188) | Cod sursa (job #2607824) | Istoria paginii runda/oji_2020_official_1 | Cod sursa (job #2269164) | Cod sursa (job #2646477)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
const int MOD=666013,
P=1332028;///per modulo MOD
long long Fibonacci(int n)
{
if(n==0) return 0;
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 k;
f>>k;
g<<Fibonacci(k%P);
return 0;
}