Pagini recente » Cod sursa (job #899192) | Cod sursa (job #177433) | Cod sursa (job #2486004) | Cod sursa (job #2080595) | Cod sursa (job #352549)
Cod sursa(job #352549)
#include <cstdio>
const int M=1999999973;
int pow(int a,int n)
{
if (n==0) return 1;
if (n&1) // n%2=1;
return (int)((long long)a*pow((long long)a*a%M,n>>1)%M); // n>>1 = n=n/2;
return pow((long long)a*a%M,n>>1);
}
int n,p;
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d%d",&n,&p);
printf("%d",pow(n,p));
}