Pagini recente » Borderou de evaluare (job #656369) | Borderou de evaluare (job #895259) | Borderou de evaluare (job #963571) | Borderou de evaluare (job #933803) | Cod sursa (job #382501)
Cod sursa(job #382501)
#include <stdio.h>
#include <stdlib.h>
const int c=1999999973;
int n,p;
int modulo(int x,int n)
{
if(n==0)
return 1;
if(n%2==1)
return x*modulo(x,n-1,c)%c;
else
{
int p=modulo(x,n/2,c);
p*=p;
return p%c;
}
}
int main()
{
//printf("%d",modulo(2,168,5));
freopen("lgput.in","r",stdin);
scanf("%d %d",&n,&p);
freopen("lgput.out","w",stdout);
printf("%d",modulo(n,p));
return 0;
}