Pagini recente » Cod sursa (job #938470) | Borderou de evaluare (job #1259483) | Cod sursa (job #3172501) | Cod sursa (job #358027) | Cod sursa (job #196422)
Cod sursa(job #196422)
#include <stdio.h>
int n,p,mod;
long long putere(int n, int p)
{
if (p==1) return n;
else if (p%2) return ((((putere(n,p/2)%mod)*(putere(n,p/2)%mod))%mod)*n)%mod;
else return ((putere(n,p/2)%mod)*(putere(n,p/2)%mod))%mod;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
mod=1999999973;
scanf("%d %d",&n,&p);
printf("%lld\n",putere(n,p) % mod);
return 0;
}