Pagini recente » Cod sursa (job #867826) | Cod sursa (job #1265766) | Cod sursa (job #838072) | Cod sursa (job #1528010) | Cod sursa (job #1035631)
/*
~Keep It Simple!~
*/
#define modil 666013
#include <stdio.h>
#include <string.h>
int n,A[3][3],B[3][3],aux[3][3];
void Multiply(int a[3][3],int b[3][3])
{
memset(aux,0,sizeof(aux));
for(int i=1;i<=2;i++)
for(int j=1;j<=2;j++)
for(int k=1;k<=2;k++)
aux[i][j]= ((aux[i][j]+1LL*a[i][k]*b[k][j])%modil);
memcpy(a,aux,sizeof(aux));
}
void Pow(int k)
{
memcpy(B,A,sizeof(A));
while(k)
{
if(k%2)
{
Multiply(B,A);
k--;
}
Multiply(A,A);
k/=2;
}
}
int main()
{
freopen("kfib.in","r",stdin);
freopen("kfib.out","w",stdout);
scanf("%d",&n);
A[1][1] = 0;
A[1][2] = A[2][2] = A [2][1] = 1;
//memset(B,1,sizeof(B));
Pow(n-2);
printf("%d",B[2][2]);
}