Pagini recente » Cod sursa (job #1424681) | Cod sursa (job #27900) | Cod sursa (job #804447) | Cod sursa (job #1850815) | Cod sursa (job #3299827)
#include <cstdio>
#include <cstring>
#define MOD 666013
int n;
int mat[3][3], res[3][3];
inline 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]) % MOD;
}
inline void pw(int p, int m[][3]) {
int tmp[3][3], aux[3][3];
memcpy(tmp, mat, sizeof(mat));
m[0][0] = m[1][1] = 1;
m[0][1] = m[1][0] = 0;
for (int i = 0; (1 << i) <= p; i++) {
if (p & (1 << i)) {
memset(aux, 0, sizeof(aux));
mul(m, tmp, aux);
memcpy(m, aux, sizeof(aux));
}
memset(aux, 0, sizeof(aux));
mul(tmp, tmp, aux);
memcpy(tmp, aux, sizeof(aux));
}
}
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;
pw(n - 1, res);
printf("%d\n", res[1][1]);
return 0;
}