Pagini recente » Cod sursa (job #537334) | Cod sursa (job #680344) | Borderou de evaluare (job #803669) | Cod sursa (job #2257395) | Cod sursa (job #643673)
Cod sursa(job #643673)
#include<cstdio>
const int MOD = 1999999973 ;
int n,p;
long long power(int a,int b)
{
if(b==1)
return a;
else
{
if(b%2==0)
{
long long sol = power(a,b/2);
return ((sol%MOD)*(sol%MOD))%MOD;
}
else
{
long long sol = power(a,b-1);
return ((sol%MOD)*(a%MOD))%MOD;
}
}
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d%d",&n,&p);
if(p==0)
printf("1\n");
else
printf("%lld\n",power(n,p));
}