Pagini recente » Cod sursa (job #2337294) | Cod sursa (job #1630381) | Solutia problemei shoturi | Cod sursa (job #1723180) | Cod sursa (job #1382568)
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 1999999973
long long p,n;
long long lgp(long long p)
{
if(p==0) return 1;
if(p%2==1)
return (n*lgp(p-1))%N;
long long x=lgp(p/2);
return (x*x)%N;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&n,&p);
printf("%lld\n",lgp(p));
return 0;
}