Pagini recente » Cod sursa (job #1520919) | Cod sursa (job #405971) | Cod sursa (job #1900660) | Cod sursa (job #2307430) | Cod sursa (job #1096044)
#include <cstdio>
#define MOD 1999999973
using namespace std;
long long n,p;
long long calcul(int n,int p)
{
if (n<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,p/2)%MOD;
else if (p%2==1) return calcul(n*n,(p-1)/2)%MOD;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%u %u", &n,&p);
printf("%u", calcul(n,p));
return 0;
}