Pagini recente » Cod sursa (job #1544446) | Cod sursa (job #746706) | Cod sursa (job #1281552) | Cod sursa (job #1851336) | Cod sursa (job #2187068)
#include <iostream>
#include <cstdio>
using namespace std;
const int MOD = 666013;
struct mat
{
int m[4][4];
void inmultire(mat a, mat b)
{
m[1][1] = 0;
m[1][2] = 0;
m[2][1] = 0;
m[2][2] = 0;
for(int i = 1; i<=2; i++)
for(int j = 1; j<=2; j++)
for(int k = 1; k<=2; k++)
m[i][j] += (1LL*a.m[i][k]*b.m[k][j])%MOD;
}
};
mat putLog(mat a, int put)
{
mat rez;
rez.m[1][1] = 1;
rez.m[1][2] = 0;
rez.m[2][1] = 0;
rez.m[2][2] = 1;
while(put!=0)
{
if(put & 1 == 0)
{
a.inmultire(a, a);
put/=2;
}
else
{
rez.inmultire(rez, a);
put--;
}
}
return rez;
}
void rez()
{
int k;
scanf("%d", &k);
mat a;
a.m[1][1] = 1;
a.m[1][2] = 1;
a.m[2][1] = 1;
a.m[2][2] = 0;
mat r;
r = putLog(a, k-2);
mat def;
def.m[1][1] = 1;
def.m[1][2] = 1;
def.m[2][1] = 0;
def.m[2][2] = 0;
r.inmultire(def, r);
printf("%d", r.m[1][1]);
}
int main()
{
freopen("kfib.in", "r", stdin);
freopen("kfib.out", "w", stdout);
rez();
return 0;
}