Pagini recente » Cod sursa (job #1889642) | Cod sursa (job #475926) | Cod sursa (job #1822115) | Cod sursa (job #2422380) | Cod sursa (job #1968932)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("lgput.in"); ofstream g("lgput.out");
long long n, p, ans;
int lgput(int p) {
if (p == 1) {
return n;
}
ans = lgput(p / 2);
ans = (ans*ans) % 1999999973;
if (p % 2 == 1) {
ans = (ans*n) % 1999999973;
}
return ans;
}
int main() {
f>>n>>p;
g<<lgput(p);
return 0;
}