Pagini recente » Cod sursa (job #1320618) | Cod sursa (job #2973380) | Cod sursa (job #1964929) | Cod sursa (job #1922716) | Cod sursa (job #2521222)
#include <fstream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
const int MOD = 1999999973;
int lgput(int n, int p) {
int r = 1;
while (p) {
if (p % 2 == 1)
r = (1LL * r * n) % MOD;
n *= n;
p /= 2;
}
return r;
}
int main() {
int n, p;
cin >> n >> p;
cout << lgput(n, p);
return 0;
}