Pagini recente » Cod sursa (job #134727) | Cod sursa (job #1007666) | Cod sursa (job #571229) | Cod sursa (job #451952) | Cod sursa (job #1829244)
#include <iostream>
#include <fstream>
#include <cstring>
#define mod 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int Z[3][3], S[3][3],n;
inline void multiply(int A[][3], int B[][3], int C[][3])
{
int i,j,k;
for(i = 0 ; i < 2 ; i++)
{
for(j = 0 ; j < 2 ; j++)
{
for(k = 0 ; k < 2 ; k++)
C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % mod;
}
}
}
inline void power(int k, int M[][3])
{
int C[3][3], AUX[3][3], i;
memcpy(C, Z, sizeof(Z));
M[0][0] = M[1][1] = 1;
for (i = 0; (1 << i) <= k; i++) {
if (k & (1 << i)) {
memset(AUX, 0, sizeof(AUX));
multiply(M, C, AUX);
memcpy(M, AUX, sizeof(AUX));
}
memset(AUX, 0, sizeof(AUX));
multiply(C, C, AUX);
memcpy(C, AUX, sizeof(C));
}
}
int main()
{
Z[0][0] = 0;
Z[0][1] = 1;
Z[1][0] = 1 ;
Z[1][1] = 1;
f>>n;
power(n-1, S);
g<<S[1][1];
return 0;
}