Pagini recente » Cod sursa (job #441179) | Cod sursa (job #1972369) | Cod sursa (job #2487174) | Rating Invincibilul (invincible) | Cod sursa (job #1736394)
#include <iostream>
#include <fstream>
using namespace std;
long long mod=1999999973;
long long power(long long n,long long p) {
long long result=1;
while (p>=1) {
if (p%2==1) {
result=(result*n)%mod;
p--;
}
n=(n*n)%mod;
p/=2;
}
return result;
}
int main() {
long long n,p;
ifstream in("lgput.in");
ofstream out("lgput.out");
in>>n>>p;
out<<power(n,p);
return 0;
}