Pagini recente » Cod sursa (job #707210) | Cod sursa (job #2938199) | Cod sursa (job #66249) | Cod sursa (job #360157) | Cod sursa (job #2270682)
#include <cstdio>
#include <cstring>
using namespace std;
const int MOD = 666013;
int MA[3][3], S[3][3],
N;
void mult(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]) % MOD;
}
void lg_p(int P, int M[][3]) {
int C[3][3], AUX[3][3];
memcpy(C, MA, sizeof(MA));
M[0][0] = M[1][1] = 1;
for(int i = 0; (1 << i) <= P; i++) {
if(P & (1 << i)) {
memset(AUX, 0, sizeof(AUX));
mult(M, C, AUX);
memcpy(M, AUX, sizeof(AUX));
}
memset(AUX, 0, sizeof(AUX));
mult(C, C, AUX);
memcpy(C, AUX, sizeof(C));
}
}
int main()
{
freopen("kfib.in", "r", stdin);
freopen("kfib.out", "w", stdout);
scanf("%i", &N);
MA[0][0] = 0;
MA[0][1] = MA[1][0] = MA[1][1] = 1;
lg_p(N-1, S);
printf("%i", S[1][1]);
return 0;
}