Pagini recente » Borderou de evaluare (job #1273742) | Cod sursa (job #666183) | Istoria paginii runda/deinceput | Borderou de evaluare (job #391010) | Cod sursa (job #546454)
Cod sursa(job #546454)
#include <cstdio>
#include <cstring>
const int n_max = 10001;
const int m = 1999999973;
int main()
{
int i,n,p;
long long a,sol=1;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d %d",&n,&p);
a=n;
for(i=0; (1<<i)<=p; ++i)
{
if(((1<<i)&p)>0)
sol=(sol*a)%m;
a=(a*a)%m;
}
printf("%lld",sol);
return 0;
}