Pagini recente » Clasament tema10d1 | Cod sursa (job #390953) | Monitorul de evaluare | Cod sursa (job #414740) | Cod sursa (job #2848849)
#include <fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long n, p;
const long long MOD = 1999999973;
long long logPow(long long n, long long p)
{
long long r = 1;
while(p)
{
if(p % 2 == 1)
r = (1LL * r * n) % MOD;
n = (1LL * n * n) % MOD;
p /= 2;
}
return r;
}
int main(int argc, const char * argv[]) {
cin>>n>>p;
cout<<logPow(n, p);
return 0;
}