Pagini recente » Cod sursa (job #2804696) | Cod sursa (job #281802) | Borderou de evaluare (job #3001715) | Cod sursa (job #501741) | Cod sursa (job #1369910)
#include <cstdio>
using namespace std;
long long n,p;
long long pow(int n,int p)
{
long long i,a,sol=1;
a=n;
for(i=0;(1<<i)<=p;i++)
{
if((1<<i)&p)
sol=(sol*a)%1999999973;
a=(a*a)%1999999973;
}
return sol;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld",&n,&p);
printf("%lld",pow(n,p));
return 0;
}