Pagini recente » Borderou de evaluare (job #2027900) | Borderou de evaluare (job #1704618) | Borderou de evaluare (job #971065) | Borderou de evaluare (job #3232773) | Cod sursa (job #2234070)
#include <iostream>
#include <fstream>
#include <vector>
const long mod = 1999999973;
using namespace std;
class Task {
public:
void solve() {
read_input();
print_output(fast_pow(base, exponent, mod));
}
private:
long long base, exponent;
void read_input() {
ifstream fin("lgput.in");
fin >> base >> exponent;
fin.close();
}
int fast_pow(long base, long exponent, long mod) {
if(exponent == 0) return 1;
else if(exponent == 1) return base % mod;
long long aux = fast_pow(base * base % mod , exponent / 2, mod);
if(exponent % 2 == 0) return aux % mod;
else return base * aux % mod;
return 0;
}
void print_output(int result) {
ofstream fout("lgput.out");
fout << result;
fout.close();
}
};
int main() {
Task task;
task.solve();
return 0;
}