Pagini recente » Cod sursa (job #2012981) | Cod sursa (job #694898) | Cod sursa (job #192421) | Cod sursa (job #415740) | Cod sursa (job #1649123)
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define MOD 1999999973
using namespace std;
int n, p;
int lgput (int n, int p)
{
int sol=1, a=n;
for(int i=0; (1<<i)<=p; i++)
{
if(((1<<i)&p)>0)
sol=(1LL*sol*a)%MOD;
a=(1LL*a*a)%MOD;
}
return sol%MOD;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d %d",&n,&p);
printf("%d\n",lgput(n,p));
return 0;
}