Pagini recente » Cod sursa (job #2903374) | Cod sursa (job #1875433) | Cod sursa (job #1767840) | Cod sursa (job #2767934) | Cod sursa (job #1844105)
#include <fstream>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int MOD = 666013;
int K;
int Sol[3][3], Z[3][3];
void Multiply(int A[3][3], int B[3][3])
{
long long C[3][3] ;
for(int i = 1; i <= 2; ++i)
for(int j = 1; j <= 2; ++j)
C[i][j] = 0;
for(int i = 1; i <= 2; ++i)
for(int j = 1; j <= 2; ++j)
for(int k = 1; k <= 2; ++k)
{
C[i][j] += 1LL * A[i][k] * B[k][j];
C[i][j] %= MOD;
}
for(int i = 1; i <= 2; ++i)
for(int j = 1; j <= 2; ++j)
A[i][j] = C[i][j];
}
int main()
{
fin >> K;
Z[1][2] = Z[2][1] = Z[2][2] = 1;
Sol[1][1] = 0; Sol[1][2] = 1;
while(K)
{
if(K % 2 == 1)
Multiply(Sol,Z);
Multiply(Z,Z);
K = K / 2;
}
fout << Sol[1][1] << "\n";
return 0;
}