Pagini recente » Cod sursa (job #1060930) | Cod sursa (job #567895) | Cod sursa (job #2204338) | Cod sursa (job #1830639) | Cod sursa (job #559515)
Cod sursa(job #559515)
#include <iostream>
#include <cstdio>
using namespace std;
const int modulo = 1999999973;
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
int n,p,i;
unsigned long long sol=1;
scanf("%d%d",&n,&p);
for (i=0; (1<<i) <= p; ++i){
if ( ( (1<<i)&p ) > 0)
sol = (sol * n) % modulo;
n = (n * n) % modulo;
}
printf("%llu\n",sol);
return 0;
}