Pagini recente » Cod sursa (job #3326038) | Cod sursa (job #1285506) | Cod sursa (job #1467633) | Cod sursa (job #2568462) | Cod sursa (job #3309405)
#include <iostream>
#include <fstream>
using namespace std;
const int mod = 666013;
int n;
int res[2][2];
int a[2][2];
void mult(int a[2][2], int b[2][2])
{
int c[2][2] = {};
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 2; k++)
{
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;
}
}
}
void exp(int p)
{
while (p)
{
if (p % 2 == 1)
{
mult(ans, a);
}
mult(a, a);
p /= 2;
}
}
int main()
{
ifstream fin("kfib.in");
ofstream fout("kfib.out");
fin >> n;
a[0][0] = 0;
a[0][1] = 1; a[1][0] = 1; a[1][1] = 1;
ans[1][0] = 0; ans[1][0] = 0; ans[0][1] =0;
ans[0][1] = 0;
exp(n);
fout << ans[0][0]
}