Pagini recente » Cod sursa (job #3287116) | Cod sursa (job #145634) | Cod sursa (job #3236612) | Cod sursa (job #3289783) | Cod sursa (job #1157454)
#include<cstdio>
#include<cstring>
#define mod 666013
using namespace std;
int n,i,m[3][3],r[3][3];
inline void inmat(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 fibo(int k,int s[][3])
{
int i,c[3][3],x[3][3];
memcpy(c,m,sizeof(m));
s[0][0]=1;
s[1][1]=1;
for(i=0;(1<<i)<=k;i++)
{
if(k&(1<<i))
{
memset(x,0,sizeof(x));
inmat(s,c,x);
memcpy(s,x,sizeof(x));
}
memset(x,0,sizeof(x));
inmat(c,c,x);
memcpy(c,x,sizeof(x));
}
}
int main()
{
freopen("kfib.in","r",stdin);
freopen("kfib.out","w",stdout);
scanf("%d",&n);
m[0][0]=0;
m[0][1]=1;
m[1][0]=1;
m[1][1]=1;
fibo(n-1,r);
printf("%d",r[1][1]);
return 0;
}