Pagini recente » Cod sursa (job #1450967) | Cod sursa (job #3180729) | Cod sursa (job #1669672) | Cod sursa (job #692089) | Cod sursa (job #1140347)
#include<fstream>
#include<algorithm>
#include<cstring>
#define MOD 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int sol[3][3],aux[3][3],k,auxiliar[3][3];
void inmulteste(int a[3][3],int b[3][3],int c[3][3])
{
int i,j,k;
for(i=1;i<=2;i++)
for(j=1;j<=2;j++)
for(k=1;k<=2;k++)
c[i][j]=(c[i][j]+1LL*a[i][k]*b[k][j])%MOD;
}
void putere()
{
sol[1][1]=sol[2][2]=1;
aux[1][1]=aux[1][2]=aux[2][1]=1;k;
while(k)
{
if(k%2==1)
{
memset(auxiliar,0,sizeof(auxiliar));
inmulteste(sol,aux,auxiliar);
memcpy(sol,auxiliar,sizeof(auxiliar));
}
memset(auxiliar,0,sizeof(auxiliar));
inmulteste(aux,aux,auxiliar);k/=2;
memcpy(aux,auxiliar,sizeof(auxiliar));
}
g<<sol[1][2];
}
int main()
{
f>>k;
putere();
return 0;
}