Pagini recente » Borderou de evaluare (job #2710692) | Cod sursa (job #811891) | Cod sursa (job #1247743) | Cod sursa (job #2296086) | Cod sursa (job #1019900)
/*
~Keep it Simple!~
*/
#include <stdio.h>
long long n,p;
long long SimplePow(int n,int p)
{
long long put=1;
while(p)
{
if(p%2)
{
put *= n;
put %= 1999999973;
p--;
}
n*=n;
n %= 1999999973;
p/=2;
}
return put;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&n,&p);
printf("%lld",SimplePow(n,p));
}