Pagini recente » Cod sursa (job #2620205) | Cod sursa (job #3218315) | Cod sursa (job #238989) | Borderou de evaluare (job #1569572) | Cod sursa (job #2349298)
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const long long MOD = 1999999973;
long long n, p;
int main() {
fin >> n >> p;
long long s = 1;
long long a = n;
for (int i = 1; i <= p; i <<= 1) {
if (i & p) {
s = (s * a) % MOD;
}
a = (a * a) % MOD;
}
fout << s;
fout.close();
return 0;
}