Pagini recente » Cod sursa (job #1861233) | Cod sursa (job #816376) | Cod sursa (job #3288306) | Cod sursa (job #2242647) | Cod sursa (job #2148978)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
class Task {
public:
void solve() {
read_input();
print_output(fast_pow(base, exponent, mod));
}
private:
int base, exponent, mod = 1999999973;
void read_input() {
ifstream fin("lgput.in");
fin >> base >> exponent;
fin.close();
}
int fast_pow(int base, int exponent, int mod) {
int ans = 1;
while(exponent > 0) {
if(exponent & 1) {
ans = 1ll * ans * base % mod;
}
base = 1ll * base * base % mod;
exponent >>= 1;
}
return ans;
}
void print_output(int result) {
ofstream fout("lgput.out");
fout << result;
fout.close();
}
};
int main() {
Task task;
task.solve();
return 0;
}