Pagini recente » Cod sursa (job #2594251) | Cod sursa (job #687171) | Cod sursa (job #3162804) | Cod sursa (job #3192903) | Cod sursa (job #2949017)
#include <bits/stdc++.h>
using namespace std;
const int mod=666013;
void prod(int p[2][2],int a[2][2])
{
int aux[2][2];
for(int i=0;i<2;i++)
{
for (int j=0;j<2;j++)
{
aux[i][j]=0;
for(int k=0;k<2;k++)
{
aux[i][j]=aux[i][j]+(long long)p[i][k]*a[k][j]%mod;
aux[i][j]=aux[i][j]%mod;
}
}
}
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
p[i][j]=aux[i][j];
}
}
}
int fibo(int n)
{
int a[2][2]={{1,1},{1,0}};
int p[2][2]={{1,0},{0,1}};
n--;
while(n)
{
int nrr=n%2;
if(nrr)
{
prod(p,a);
}
prod(a,a);
n=n/2;
}
return p[0][0];
}
int main()
{
ifstream f("kfib.in");
ofstream g("kfib.out");
int k;
f>>k;
g<<fibo(k);
return 0;
}