Pagini recente » Cod sursa (job #2779270) | Cod sursa (job #775328)
Cod sursa(job #775328)
#include <cstdio>
#include <cstring>
using namespace std;
const int M=666013;
int N, i;
int MAT[3][3], SOL[3][3];
void Mul(int A[][3], int B[][3], int C[][3])
{
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j)
for (int k = 0; k < 2; ++k)
C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % M;
}
void Pwr(int P, int M[][3])
{
int C[3][3], AUX[3][3], i;
memcpy(C, MAT, sizeof(MAT));
M[0][0] = M[1][1] = 1;
for (i = 0; (1 << i) <= P; ++i)
{
if (P & (1 << i))
{
memset(AUX, 0, sizeof(AUX));
Mul(M, C, AUX);
memcpy(M, AUX, sizeof(AUX));
}
memset(AUX, 0, sizeof(AUX));
Mul(C, C, AUX);
memcpy(C, AUX, sizeof(C));
}
}
int main()
{
freopen("kfib.in", "r", stdin);
freopen("kfib.out", "w", stdout);
scanf("%d", &N);
MAT[0][0] = 0; MAT[0][1] = 1; MAT[1][0] = 1; MAT[1][1] = 1;
Pwr(N - 1, SOL);
printf("%d\n", SOL[1][1]);
}