Pagini recente » Cod sursa (job #2321141) | Cod sursa (job #2809670) | Borderou de evaluare (job #2787921) | Cod sursa (job #235941) | Cod sursa (job #370835)
Cod sursa(job #370835)
#include <stdio.h>
int n,p;
const int M=1999999973;
int pow(int a,int n)
{
if(n==0) return 1;
if (n%2) return (long long)a*pow((long long)a*a%M,n/2)%M;
return pow((long long)a*a%M,n/2);
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d%d",&n,&p);
printf("%d",pow(n,p));
return 0;
}