Cod sursa(job #941994)
#include <fstream>
using namespace std;
ifstream ("kfib.in");
ofstream ("kfib.out");
int const N=666013;
void produs (int p[2][2], int a[2][2], int b[2][2])
{
int aux[2][2];
aux[0][0]=(a[0][0]*b[0][0]%N+a[0][1]*b[1][0]%N)%N;
aux[0][1]=(a[0][0]*b[0][1]%N+a[0][1]*b[1][1]%N)%N;
aux[1][0]=(a[1][0]*b[0][0]%N+a[1][1]*b[1][0]%N)%N;
aux[1][1]=(a[1][0]*b[0][1]%N+a[1][1]*b[1][1]%N)%N;
for (int i=0; i<=2; i++)
for (int j=0; j<=2; j++)
p[i][j]=aux[i][j];
}
void ridica (int n[2][2], int p)
{
if (p==1) return n;
if (p%2==0) return ridica((long long)produs()%N, p/2);
if (p%2==1) return (long long)n*ridica((long long)n*n%I, p/2)%I;
}
int main()
{
int
return 0;
}