Pagini recente » Cod sursa (job #2568020) | Cod sursa (job #1549174) | Cod sursa (job #678463) | Cod sursa (job #823386) | Cod sursa (job #661784)
Cod sursa(job #661784)
#include<cstdio>
using namespace std;
int m=1999999973;
long long n,k=1,p,n1=1,n2;
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld\n",&n,&p);
n=n%m;n2=n;
while(p>1)
{
while(k<=p/2)
{
n2=((n2%m)*(n2%m))%m;
k=k*2;
}
p=p-k;
n1=(n1*n2)%m;
n2=n;
k=1;
}
if(p==1) n1=(n1*n)%m;
printf("%lld\n",n1);
fclose(stdin);fclose(stdout);
return 0;
}