Pagini recente » Cod sursa (job #107339) | Cod sursa (job #2568921) | Cod sursa (job #2237996) | Cod sursa (job #940629) | Cod sursa (job #2959689)
#include <fstream>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int N, fibo[2][2], multip[2][2];
const int MOD = 666013;
int main()
{
fin >> N;
fibo[0][0] = fibo[0][1] = 1;
multip[0][0] = multip[0][1] = multip[1][0] = 1;
N -= 2;
while (N)
{
if (N & 1)
{
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] + 1LL * fibo[i][k] * multip[k][j]) % MOD;
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
fibo[i][j] = aux[i][j];
}
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] + 1LL * multip[i][k] * multip[k][j]) % MOD;
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
multip[i][j] = aux[i][j];
N >>= 1;
}
fout << fibo[0][0] << "\n";
return 0;
}