Pagini recente » Cod sursa (job #2885454) | Cod sursa (job #1454448) | Cod sursa (job #2894576) | Cod sursa (job #2171290) | Cod sursa (job #2230198)
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1999999973;
//Complexitate O(b)
long long powerBrute (long long a, long long b) {
long long rez = 1;
for (long long i = 1; i <= b; ++i) {
rez = (rez * a) % MOD;
}
return rez;
}
long long powerOptim (long long a, long long b) {
long long rez = 1;
while (b != 0) {
if (b % 2 == 0) {
a = (a * a) % MOD;
b = b / 2;
}
else {
rez = (rez * a) % MOD;
a = (a * a) % MOD;
b = (b - 1) / 2;
}
}
return rez;
}
int main()
{
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
long long a, b;
fin >> a >> b;
fout << powerBrute(a, b);
return 0;
}