Pagini recente » Cod sursa (job #2854690) | Cod sursa (job #1085257) | Cod sursa (job #2777960) | Cod sursa (job #2559637) | Cod sursa (job #1211058)
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll n,p;
const ll mod = 1999999973;
ll exp(ll base,ll exponent){
ll res = 1;
while(exponent){
if(exponent & 1)
res = (res * base) % mod;
base = (base * base) % mod;
exponent >>= 1;
}
return res;
}
int main(){
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&n,&p);
printf("%lld\n",exp(n,p));
return 0;
}