Pagini recente » Cod sursa (job #48706) | Cod sursa (job #1052826) | Cod sursa (job #2951978) | Cod sursa (job #3288094) | Cod sursa (job #3260201)
#include <fstream>
using namespace std;
const int MOD = 666013;
void produs(int p[2][2], int a[2][2])
{
int aux[2][2];
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
aux[i][j] = 0;
for (int k = 0; k < 2; k++)
{
aux[i][j] = (aux[i][j] + (long long)p[i][k] * a[k][j]) % MOD;
}
}
}
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
p[i][j] = aux[i][j];
}
}
}
void putere(int p[2][2], int a[2][2], int n)
{
p[0][0] = p[1][1] = 1;
p[0][1] = p[1][0] = 0;
while (n != 0)
{
int cifb = n % 2;
if (cifb != 0)
{
produs(p, a);
}
produs(a, a);
n /= 2;
}
}
int main()
{
ifstream in("kfib.in");
ofstream out("kfib.out");
int n;
in >> n;
int a[2][2] = {{1, 1}, {1, 0}};
int p[2][2];
putere(p, a, n - 1);
out << p[0][0];
in.close();
out.close();
return 0;
}