Pagini recente » Cod sursa (job #295207) | Cod sursa (job #1638130) | Cod sursa (job #2913593) | Cod sursa (job #2433586) | Cod sursa (job #2392657)
#include <fstream>
#define MOD 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
long long c[4][4],sol[4][4];
void inmultire(long long a[4][4],long long b[4][4])
{ long long c[5][5],i,j,k;
for(i=1;i<=2;i++)
for(j=1;j<=2;j++)
c[i][j]=0;
for(i=1;i<=2;i++)
for(j=1;j<=2;j++)
for(k=1;k<=2;k++)
c[i][j]+=(a[i][k]*b[k][j])%MOD;
for(i=1;i<=2;i++)
for(j=1;j<=2;j++)
a[i][j]=c[i][j]%MOD;
}
void putere(long long k)
{ while(k)
{if(k%2==1){inmultire(sol,c);k--;}
else{inmultire(c,c);k/=2;}}
}
int main()
{
sol[1][1]=0;
sol[1][2]=1;
sol[2][1]=0;
sol[2][2]=0;
long long x;
c[1][1]=0;
c[1][2]=1;
c[2][1]=1;
c[2][2]=1;
f>>x;
if(x>1)putere(x-1);
g<<sol[1][2];
return 0;
}