Pagini recente » Borderou de evaluare (job #286978) | Borderou de evaluare (job #2487764) | Borderou de evaluare (job #2196178) | Borderou de evaluare (job #135093) | Cod sursa (job #380629)
Cod sursa(job #380629)
#include <cstdio>
#include <cstring>
#define file_in "kfib.in"
#define file_out "kfib.out"
#define Mod 666013
int N,a[2][2],b[2][2];
void mul(int a[2][2], int b[2][2])
{
int i,j,k;
int c[2][2];
memset(c,0,sizeof(c));
for (i=0;i<2;++i)
for (j=0;j<2;++j)
for (k=0;k<2;++k)
c[i][j]=((long long)c[i][j]+(long long)a[i][k]*b[k][j])%Mod;
memcpy(a,c,sizeof(c));
}
int main()
{
freopen(file_in,"r",stdin);
freopen(file_out,"w",stdout);
scanf("%d", &N);
N--;
a[0][0]=b[0][0]=b[0][1]=b[1][0]=1;
while(N)
{
if (N&1)
mul(a,b);
mul(b,b);
N>>=1;
}
printf("%d\n", a[0][0]);
fclose(stdin);
fclose(stdout);
return 0;
}