Pagini recente » Cod sursa (job #23750) | Cod sursa (job #3159494) | Cod sursa (job #938955) | Cod sursa (job #2929798) | Cod sursa (job #3129310)
#include <fstream>
#include <iostream>
#define ll long long
#define MOD 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
ll a[3][3], r[3][3];
void multiply(ll a[][3], ll b[][3])
{
ll rez[3][3] = { 0 };
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
rez[i][j] = (rez[i][j] + (a[i][k]*1LL * b[k][j])%MOD)%MOD;
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
a[i][j] = rez[i][j]%MOD;
}
void lg(ll a[][3], ll k)
{
while (k)
{
if (k % 2 == 0)
{
multiply(a, a);
k /= 2;
}
else
{
multiply(r, a);
k--;
}
}
}
int main()
{
r[0][0]=1; r[0][1]=0; r[1][0]=0; r[1][1]=1;
a[0][0]=0; a[0][1]=a[1][1]=a[1][0]=1;
ll k;
f>>k;
lg(a,k);
g<<r[1][0]%MOD;
}