Pagini recente » Cod sursa (job #22611) | Cod sursa (job #2126829) | Cod sursa (job #487318) | Cod sursa (job #1197986) | Cod sursa (job #1096093)
#include <cstdio>
#define MOD 1999999973
using namespace std;
long long n,p;
long long calcul(long long n,long long p)
{
if (p<0) calcul(1/n,p*(-1))%MOD;
else if (p==0) return 1;
else if (p==1) return n%MOD;
else if (p%2==0) return calcul((n*n)%MOD,p/2)%MOD;
else if (p%2==1) return n*calcul((n*n)%MOD,(p-1)/2)%MOD;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld", &n,&p);
printf("%d", calcul(n,p));
return 0;
}