Pagini recente » Rezultatele filtrării | Borderou de evaluare (job #711582) | Cod sursa (job #6671) | Borderou de evaluare (job #1485841) | Cod sursa (job #146840)
Cod sursa(job #146840)
#include <stdio.h>
unsigned long n,p;
long power(long long base,long p,long mod){
long rez=1;
while (p>0){
if ((long)(p&1)==1)rez=(rez*base)%mod;
base=(base*base)%mod;
p>>=1;
}
return rez;
}
int main(){
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%ld %ld",&n,&p);
printf("%ld\n",power(n,p,1999999973));
return 0;
}