Pagini recente » Cod sursa (job #2084993) | Cod sursa (job #41619) | Cod sursa (job #2929767) | Cod sursa (job #1892561) | Cod sursa (job #575039)
Cod sursa(job #575039)
#include <cstdio>
#include <cstring>
#define MOD 666013
using namespace std;
int a[2][2],sol[2][2],n;
void mult(int a[2][2],int b[2][2])
{
int c[2][2];
memset(c,0,sizeof(c));
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)%MOD;
memcpy(a,c,sizeof(c));
}
int main()
{
freopen("kfib.in","r",stdin);
freopen("kfib.out","w",stdout);
scanf("%d",&n);
a[0][1]=a[1][0]=a[1][1]=1;
sol[0][0]=sol[1][1]=1;
--n;
while(n)
{
if(n&1)
mult(sol,a);
mult(a,a);
n>>=1;
}
printf("%d\n",sol[1][1]);
return 0;
}