Pagini recente » Borderou de evaluare (job #1057184) | Borderou de evaluare (job #1510412) | Cod sursa (job #735293) | Borderou de evaluare (job #1953194) | Cod sursa (job #412372)
Cod sursa(job #412372)
#include <cstdio>
long long n,p,imp=1999999973;
long long pute(int n,int p)
{
if (p==1)
return n;
if (p&1)
return (pute(n,(p+1)/2)*pute(n,(p-1)/2))%imp;
else
return (pute(n,p/2)*pute(n,p/2))%imp;
}
int main()
{
freopen ("lgput.in","r",stdin);
freopen ("lgput.out","w",stdout);
scanf("%lld%lld",&n,&p);
printf("%lld",pute(n,p));
return 0;
}