Pagini recente » Cod sursa (job #2190599) | Cod sursa (job #301882) | Diferente pentru problema/halftree intre reviziile 24 si 5 | Cod sursa (job #1929128) | Cod sursa (job #212188)
Cod sursa(job #212188)
#include <cstdio>
#define M 1999999973
long long n,p,pr;
void read(){
freopen("lgput.in","r",stdin);
scanf("%lld%lld",&n,&p);
}
void solve(){
pr=1;
n%=M;
while (p){
if (p%2)
pr=pr*n%M;
n=n*n%M;
p/=2;
}
}
void write(){
freopen("lgput.out","w",stdout);
printf("%lld\n",pr%M);
}
int main(){
read();
solve();
write();
}