Pagini recente » Borderou de evaluare (job #2760219) | Cod sursa (job #1527655) | Cod sursa (job #2406577) | Cod sursa (job #1318419) | Cod sursa (job #1939156)
#include<bits/stdc++.h>
using namespace std;
FILE *in = fopen("kfib.in", "r"), *out = fopen("kfib.out", "w");
const int MOD = 666013;
long long n, F;
long long F1, F0;
void read()
{
fscanf(in, "%lld", &n);
}
void solve()
{
if( n <= 1 ){
F = n;
return;
}
F1 = 1;
F0 = 0;
for(int i = 2; i <= n; i ++)
{
F = F1 + F0;
F0 = F1;
F1 = F;
}
}
void print()
{
fprintf(out, "%lld", F1%MOD);
}
int main()
{
read();solve();print();
return 0;
}