Pagini recente » Borderou de evaluare (job #1488119) | Borderou de evaluare (job #1551191) | Cod sursa (job #659534) | Cod sursa (job #2797261) | Cod sursa (job #461145)
Cod sursa(job #461145)
#include <stdio.h>
const int n_max = 10001;
const int m = 1999999973;
int main()
{
unsigned 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 = 1; i<= p/2; ++ i)
sol=(sol*a*a)%m;
if(p%2==1)
sol=(sol*a)%m;
printf("%lld\n", sol);
}