Pagini recente » Cod sursa (job #2567646) | Cod sursa (job #605771) | Cod sursa (job #2720327) | Cod sursa (job #254957) | Cod sursa (job #1373677)
#include <fstream>
using namespace std;
const int Mod = 1999999973;
int n, p;
long long sol = 1, aux;
void Citire() {
ifstream in("lgput.in");
in >> n >> p;
in.close();
}
void Solve() {
aux = n;
for (int i = 1; i <= p; i *= 2) {
if (p & i)
sol = (sol * aux) % Mod;
aux = (aux * aux) % Mod;
}
}
void Afisare() {
ofstream out("lgput.out");
out << sol << '\n';
out.close();
}
int main() {
Citire();
Solve();
Afisare();
return 0;
}