Pagini recente » Cod sursa (job #1860467) | Cod sursa (job #1248651) | Cod sursa (job #1551881) | Cod sursa (job #1987224) | Cod sursa (job #3314157)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 666013;
int A[2][2] = {{1, 1}, {1, 0}};
int I[2][2] = {{1, 0}, {0, 1}};
ifstream f("kfib.in");
ofstream g("kfib.out");
void mulmat(int a[][2], int b[][2])
{
long long c[2][2];
int i, j, k;
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
{
c[i][j] = 0;
for(k = 0; k < 2; k++)
c[i][j] += 1LL * a[i][k] * b[k][j];
}
for(j = 0; i < 2; i++)
for(j = 0; j < 2; j++)
a[i][j] = c[i][j] % MOD;
}
void puteremat(int p)
{
while(p)
{
if(p % 2)
mulmat(I, A);
mulmat(A, A);
p /= 2;
}
}
int main()
{
int k;
f >> k;
if(k <= 1)
g << k;
else
{
puteremat(k - 1);
g << I[0][0];
}
return 0;
}