Pagini recente » Cod sursa (job #2286932) | Cod sursa (job #1997630) | Cod sursa (job #867104) | Cod sursa (job #1447262) | Cod sursa (job #1907100)
#include <bits/stdc++.h>
#define Mod 666013
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int a[3][3], b[3][3], N;
inline void Copy_Mat(int a[3][3], int b[3][3])
{
for(int i = 1; i <= 2; i++)
for(int j = 1; j <= 2; j++)
a[i][j] = b[i][j];
}
inline void Mat_Mult(int a[3][3], int b[3][3])
{
int c[3][3];
int i, j, k;
long long s;
for(i = 1; i <= 2; i++)
for(j = 1; j <= 2; j++)
{
s = 0;
for(k = 1; k <= 2; k++)
s += (1LL* a[i][k] * b[k][j]);
c[i][j] = s % Mod;
}
Copy_Mat(a, c);
}
inline void Lg_Pow_Mat(int a[3][3], int p)
{
int c[3][3];
c[1][1] = 0;
c[1][2] = c[2][1] = c[2][2] = 1;
while(p)
{
if(p & 1)
Mat_Mult(c, a);
Mat_Mult(a, a);
p /= 2;
}
Copy_Mat(a, c);
}
int main()
{
fin >> N;
a[1][2] = 1;
b[1][2] = b[2][1] = b[2][2] = 1;
if(N == 0) fout << "0\n";
else
{
Lg_Pow_Mat(b, N - 1);
Mat_Mult(a, b);
fout << a[1][1] << "\n";
}
fin.close();
fout.close();
return 0;
}