Pagini recente » Cod sursa (job #556096) | Cod sursa (job #1204315) | Cod sursa (job #817559) | Cod sursa (job #2815486) | Cod sursa (job #849195)
Cod sursa(job #849195)
#include <cstdio>
#include <cstring>
int n,i,mod=666013;
int mat[3][3],sol[3][3];
inline void mult(int a[][3], int b[][3], int c[][3]) {
int i,j,k;
for(i=0;i<2;i++)
for(j=0;j<2;j++)
for(k=0;k<2;k++)
c[i][j]=(c[i][j]+1LL*a[i][k]*b[k][j])%mod;
}
inline void lg_power(int p, int mat[][3])
{
int c[3][3],aux[3][3],i;
memcpy(c,mat,sizeof(mat));
mat[0][0]=mat[1][1]=1;
for (i = 0; (1 << i) <= p; i++) {
if (p & (1 << i))
{
memset(aux,0,sizeof(aux));
mult(mat,c,aux);
memcpy(mat,aux,sizeof(aux));
}
memset(aux,0,sizeof(aux));
mult(c,c,aux);
memcpy(c,aux,sizeof(c));
}
}
int matain()
{
freopen("kfib.in","r",stdin);
freopen("kfib.out","w",stdout);
scanf("%d",&n);
mat[0][0]=0;mat[0][1]=mat[1][0]=mat[1][1]=1;
lg_power(n-1,sol);
printf("%d\n",sol[1][1]);
return 0;
}