Pagini recente » Cod sursa (job #1948963) | Cod sursa (job #2522151) | Cod sursa (job #2631541) | Cod sursa (job #1943287) | Cod sursa (job #2150065)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int mod = 666013;
int a[2][2] = {
{0, 1},
{1, 1}
};
int ret[2][2] = {
{1, 0}, //- I1;
{0, 1},
};
int c[2][2], n;
inline void netmult(int a[2][2], int b[2][2], int c[2][2])
{
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
{
c[i][j] = 0;
for(int k = 0; k < 2; k++)
c[i][j] = (c[i][j] + (1LL * a[i][k] * b[k][j]) % mod)% mod;
}
}
inline int fib(int n)
{
n--;
for(; n; n >>= 1)
{
if(n & 1)
{
netmult(a, ret, c);
memcpy(ret, c, sizeof(ret));
}
netmult(a, a, c);
memcpy(a, c, sizeof(a));
}
return ret[1][1];
}
int main()
{
fin >> n;
fout << fib(n);
return 0;
}