Pagini recente » Cod sursa (job #417857) | Borderou de evaluare (job #3295621) | Cod sursa (job #2439926) | Diferente pentru problema/inversmodular intre reviziile 117 si 76 | Cod sursa (job #447064)
Cod sursa(job #447064)
#include<stdio.h>
const long long r = 1999999973;
int n,p;
int dobrepute(int a,int n)
{
int p = 1;
while(n)
{
if(n%2==1)
p=(long long)p*a%r;
a=(long long)a*a%r;
n/=2;
}
return p;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d%d",&n,&p);
printf("%d",dobrepute(n,p));
return 0;
}