Pagini recente » Diferente pentru summer-challenge-2007/solutii/runda-2 intre reviziile 17 si 18 | Istoria paginii runda/dasdasd | Istoria paginii utilizator/dan.gutu | Articole | Cod sursa (job #2355175)
#include <iostream>
#include <cstdio>
#define MOD 1999999973
using namespace std;
long long p,n,q=1;
int log()
{
while(p)
{
if(p%2==0)
{
n=(n*n)%MOD;
p/=2;
}
else{
q=(q*n)%MOD;
p--;
}
}
q=q%MOD;
printf("%lld",q);
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld",&n,&p);
log();
return 0;
}