Pagini recente » Cod sursa (job #1565889) | Cod sursa (job #2775144) | Cod sursa (job #3247974) | Cod sursa (job #1708625) | Cod sursa (job #2416238)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
const int MOD = 1999999973;
long long n, p;
long long res = 1;
void lgput(long long n, long long p) {
for(int i = 0; (1 << i) <= p; i++) {
if(0 < ((1 << i) & p))
res = (res * n) % MOD;
n = (n * n) % MOD;
}
}
int main()
{
in >> n >> p;
lgput(n, p);
out << res << '\n';
in.close();
out.close();
return 0;
}