Pagini recente » Cod sursa (job #2471437) | Cod sursa (job #179678) | Cod sursa (job #470119) | Cod sursa (job #1075627) | Cod sursa (job #2638812)
#include <iostream>
#include <fstream>
using namespace std;
int MOD = 1999999973;
int lgput(int x, int n) {
} else if (n == 1) {
return x;
} else if (n % 2 == 0) {
return lgput (1LL * x * x % MOD, n / 2);
} else {
return 1LL * x * lgput(x * x, (n - 1)/2) % MOD;
}
}
int main()
{
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n, p, remainder;
fin >> n >> p;
fout << remainder;
return 0;
}