Pagini recente » Borderou de evaluare (job #2538353) | Cod sursa (job #2010931) | Borderou de evaluare (job #1835031) | Algoritmiada 2009 | Cod sursa (job #434645)
Cod sursa(job #434645)
#include <stdio.h>
#define MOD 1999999973
int n,p;
int exp(int n,int p) {
if(p == 1) return n % MOD;
if(p % 2 ) return (exp(n,p-1) * (n % MOD)) % MOD;
int val = exp(n,p/2);
return ( val * val ) % MOD;
}
int main() {
//freopen("lgput.in","r",stdin);
//freopen("lgput.out","w",stdout);
scanf("%d %d",&n,&p);
printf("%d\n",exp(n,p));
return 0;
}