Pagini recente » Cod sursa (job #3189481) | Cod sursa (job #824057) | Cod sursa (job #2875895) | Cod sursa (job #2828739) | Cod sursa (job #1385284)
#include<cstdio>
const int n_max = 10001;
const int m = 1999999973;
using namespace std;
int main()
{
long long a, sol=1;
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
int n, p, i;
scanf("%d %d", &n, &p);
a=n;
for(i=0; (1<<i)<=p; ++i)
{
if(((1<<i)&p)>0)
{
sol=(sol*a)%m;
//printf("sol: %lld\n", sol);
}
a=(a*a)%m;
//printf("a:%lld\n", a);
}
printf("%lld", sol);
return 0;
}