Pagini recente » Cod sursa (job #3129579) | Cod sursa (job #2450296) | Cod sursa (job #1669965) | Cod sursa (job #2385420) | Cod sursa (job #146290)
Cod sursa(job #146290)
#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("%d\n",putere(n,p) % mod);
return 0;
}