Pagini recente » Cod sursa (job #168039) | Cod sursa (job #2519145) | Cod sursa (job #2074059) | Cod sursa (job #1128575) | Cod sursa (job #1834263)
#include <cstdio>
#include <cstring>
#define mod 666013
using namespace std;
int n, i;
int mat[3][3], sol[3][3];
void inmultire(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 putere(int p, int m[][3])
{
int c[3][3], aux[3][3];
memcpy(c, mat, sizeof(mat));
m[0][0] = m[1][1] = 1;
for (int i = 0; (1 << i) <= p; i++)
{
if (p & (1 << i))
{
memset(aux, 0, sizeof(aux));
inmultire(m, c, aux);
memcpy(m, aux, sizeof(aux));
}
memset(aux, 0, sizeof(aux));
inmultire(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;
putere(n - 1, sol);
printf("%d\n", sol[1][1]);
return 0;
}