Pagini recente » Cod sursa (job #290814) | Cod sursa (job #2082591) | Cod sursa (job #1019856) | Cod sursa (job #305851) | Cod sursa (job #1642843)
#include <cstdio>
#include<cstring>
#define mod 666013
using namespace std;
long long n,i,m[4][4],r[4][4];
void inmat(long long a[][4],long long b[][4],long long c[][4])
{
long long i,j,k;
for(i=1;i<=3;i++)
{
for(j=1;j<=3;j++)
for(k=1;k<=3;k++)
c[i][j]=(c[i][j]+a[i][k]*b[k][j])%mod;
}
}
void fibo(long long k,long long s[][4])
{
long long i,c[4][4],x[4][4];
memcpy(c,m,sizeof(m));
s[1][1]=1;
s[2][2]=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("%lld",&n);
m[1][1]=0;
m[1][2]=m[2][1]=m[2][2]=1;
fibo(n-1,r);
printf("%lld",r[2][2]);
return 0;
}