Pagini recente » infoarena - comunitate informatica, concursuri de programare | Cod sursa (job #3193137) | Cod sursa (job #1675163) | Cod sursa (job #2157265) | Cod sursa (job #1727688)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int mod = 666013;
int K;
int a[5][5],b[5][5];
inline void Copy(int a[5][5], int b[5][5])
{
for(int i = 1; i <= 2; i++)
for(int j = 1; j <= 2; j++)
a[i][j] = b[i][j];
}
inline void Mult_Mat(int a[5][5], int b[5][5])
{
int c[5][5];
int i,j,k;
long long s;
for(i = 1; i <= 2; i++)
for(j = 1; j <= 2; j++)
{
s = 0;
for(k = 1; k <= 2; k++)
s += (1LL* a[i][k] * b[k][j]);
c[i][j] = s%mod;
}
Copy(a,c);
}
inline void Pow_Log(int a[5][5],int p)
{
int sol[5][5];
sol[1][1] = 0;
sol[1][2] = sol[2][1] = sol[2][2] = 1;
while(p)
{
if(p & 1)
{
Mult_Mat(sol,a);
p--;
}
Mult_Mat(a,a);
p /= 2;
}
Copy(a,sol);
}
int main()
{
fin >> K;
a[1][2] = 1;
b[1][2] = b[2][1] = b[2][2] = 1;
if(!K) fout << "0\n";
else
{
Pow_Log(b,K-1);
Mult_Mat(a,b);
fout << a[1][1] << "\n";
}
fout.close();
return 0;
}