Pagini recente » Diferente pentru problema/order2 intre reviziile 5 si 4 | Monitorul de evaluare | Cod sursa (job #2691901) | Borderou de evaluare (job #1100975) | Cod sursa (job #2345192)
#include <fstream>
typedef long long ll;
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
ll n, p;
ll pow(ll n, ll p) {
ll ans = 1;
while(p) {
if(p & 1)
ans = (ans * n) % 1999999973;
p >>= 1;
n = (n * n) % 1999999973;
}
return ans;
}
int main() {
cin >> n >> p;
cout << pow(n, p);
return 0;
}