Pagini recente » Cod sursa (job #1380877) | Cod sursa (job #2925992) | Cod sursa (job #2205643) | Cod sursa (job #3165868) | Cod sursa (job #2705713)
#include <fstream>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int MOD = 666013;
int K;
int Z[2][2]; int Sol[2][2];
void Read()
{
fin >> K;
}
void Multiply(int A[2][2],int B[2][2])
{
long long C[2][2];
for(int i = 0; i < 2; ++i)
for(int j = 0; j < 2; ++j)
C[i][j] = 0;
for(int i = 0; i < 2; ++i)
for(int j = 0; j < 2; ++j)
{
for(int k = 0; k < 2; ++k)
C[i][j] = C[i][j] + 1LL * A[i][k] * B[k][j];
C[i][j] %= MOD;
}
for(int i = 0; i < 2; ++i)
for(int j = 0; j < 2; ++j)
A[i][j] = C[i][j];
}
void Multiply2(int A[1][2],int B[2][2])
{
long long C[1][2];
for(int i = 0; i < 1; ++i)
for(int j = 0; j < 2; ++j)
C[i][j] = 0;
for(int i = 0; i < 1; ++i)
for(int j = 0; j < 2; ++j)
{
for(int k = 0; k < 2; ++k)
C[i][j] = C[i][j] + 1LL * A[i][k] * B[k][j];
C[i][j] %= MOD;
}
for(int i = 0; i < 1; ++i)
for(int j = 0; j < 2; ++j)
A[i][j] = C[i][j];
}
void Solve()
{
Z[0][1] = Z[1][0] = Z[1][1] = 1;
Sol [0][1] = 1;
while(K)
{
if(K % 2)
{
Multiply2(Sol,Z);
}
Multiply(Z,Z);
K = K / 2;
}
}
void Print()
{
fout << Sol[0][0] << "\n";
}
int main()
{
Read();
Solve();
Print();
}