Pagini recente » Cod sursa (job #392994) | Cod sursa (job #36074) | Cod sursa (job #1301197) | Cod sursa (job #2983478) | Cod sursa (job #3298360)
#include <fstream>
#include <vector>
using namespace std;
const int MOD = 666013;
const int N = 2;
void produs(vector <vector <int>> &a, vector <vector <int>> &b)
{
vector <vector <int>> p(N);
for (int i = 0; i < N; i++)
{
p[i].resize(2, 0);
for (int j = 0; j < N; j++)
{
for (int k = 0; k < N; k++)
{
p[i][k] += (long long)a[i][j] * b[j][k] % MOD;
if (p[i][k] >= MOD)
{
p[i][k] -= MOD;
}
}
}
}
a = p;
}
void putere(vector <vector <int>> &a, int n)
{
vector <vector <int>> p(N);
p[0] = {1, 0};
p[1] = {0, 1};
while (n != 0)
{
if (n % 2 != 0)
{
produs(p, a);///p *= a
}
produs(a, a);///a *= a
n /= 2;
}
a = p;
}
int main()
{
ifstream in("kfib.in");
ofstream out("kfib.out");
int n;
in >> n;
vector <vector <int>> a(N);
a[0] = {1, 1};
a[1] = {1, 0};
putere(a, n - 1);
out << a[0][0] << "\n";
in.close();
out.close();
return 0;
}