Pagini recente » Cod sursa (job #2351048) | Cod sursa (job #2190780) | Cod sursa (job #877009) | Cod sursa (job #2148678) | Cod sursa (job #2105213)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int m[2][2] = {{1, 1}, {1, 0}};
int x[2][2] = {{1, 0}, {0, 1}};
const int MOD = 666013;
void inmm(int a[][2], int b[][2]) //a=a*b;
{
long long t[2][2];
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
{
t[i][j] = 0;
for(int k = 0; k < 2; k++)
t[i][j] +=1LL* a[i][k] * b[k][j];
}
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
a[i][j] = t[i][j] % MOD;
}
int putere(int p)
{
while(p > 0)
if(p % 2 == 0)
{
p /= 2;
inmm(m, m); //m*=m(matrice)
}
else
{
p--;
inmm(x, m);
}
return x[0][0];
}
int main()
{
int K;
f >> K;
if(K <= 1)
g << K;
else
g << putere(K - 1);
return 0;
}