Pagini recente » Borderou de evaluare (job #1977257) | Borderou de evaluare (job #1063851) | Diferente pentru problema/compact intre reviziile 8 si 3 | Borderou de evaluare (job #1251105) | Cod sursa (job #1508301)
#include<cstdio>
using namespace std;
const long long MOD=19999973;
unsigned n,p;
unsigned power(unsigned a,unsigned b)
{
unsigned sol=1;
for(;b;b>>1)
{
if(b&1) sol=(1LL*sol*a)%MOD;
a=(1LL*a*a)%MOD;
}
return sol;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d %d",&n,&p);
printf("%d\n",power(n,p));
}