Pagini recente » Statisticile problemei Metro | Cod sursa (job #202868) | Cod sursa (job #3241684) | Cod sursa (job #1472964) | Cod sursa (job #1590040)
#include <fstream>
#define MOD 1999999973
using namespace std;
ifstream cin ("lgput.in");
ofstream cout ("lgput.out");
long long n, p;
long long pow(long long n, long long p) {
if(p == 0) {
return 1;
}
if(p == 1) {
return n;
}
if(p % 2 == 0) {
long long x = pow(n, p / 2) % MOD;
return (x * x) % MOD;
}
else {
return (n * pow(n, p - 1) ) % MOD;
}
}
void read() {
cin >> n >> p;
}
void print() {
cout << pow(n, p);
}
int main() {
read();
print();
return 0;
}