Pagini recente » Monitorul de evaluare | Istoria paginii utilizator/xkz01 | Rating Foldenyi Carol Tiberiu (FCT) | Cod sursa (job #407271) | Cod sursa (job #3149085)
#include <fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
const int MOD = 1999999973;
int lgput(int n, int p){
int rez = 1;
while(p){
if(p % 2 == 1)
rez = ((long long)rez * n) % MOD;
n = ((long long)n * n) % MOD;
p /= 2;
}
return rez;
}
int main() {
int n, p;
cin >> n >> p;
cout << lgput(n, p) % MOD;
return 0;
}