Pagini recente » Cod sursa (job #3257010) | Cod sursa (job #1989359) | Cod sursa (job #2919427) | Cod sursa (job #1977002) | Cod sursa (job #1822657)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int MOD = 666013;
int n;
int a[5][5], b[5][5];
inline void Mult_Mat(int a[][5], int b[][5])
{
int c[5][5], i, j, k;
for(i = 1; i <= 2; i++)
for(j = 1; j <= 2; j++)
c[i][j] = 0;
for(i = 1; i <= 2; i++)
for(k = 1; k <= 2; k++)
for(j = 1; j <= 2; j++)
c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % MOD;
for(i = 1; i <= 2; i++)
for(j = 1; j <= 2; j++)
a[i][j] = c[i][j];
}
inline void Pow_Log(int a[][5], int p)
{
int c[5][5], i, j;
for(i = 0; i <= 4; i++)
for(j = 0; j <= 4; j++)
c[i][j] = 0;
c[1][1] = c[2][2]=1;
while(p)
{
if(p & 1)
{
--p;
Mult_Mat(c,a);
}
p >>= 1;
Mult_Mat(a,a);
}
for(i = 1; i <= 2; ++i)
for(j = 1; j <= 2; ++j)
a[i][j] = c[i][j];
}
int main()
{
fin >> n;
if(!n)
fout << "0\n";
else
{
a[1][2] = 1;
b[1][2] = b[2][1] = b[2][2]=1;
Pow_Log(b, n - 1);
Mult_Mat(a, b);
fout << a[1][2] << "\n";
}
return 0;
}