Pagini recente » Cod sursa (job #2293579) | Cod sursa (job #1589346) | Cod sursa (job #1459591)
#include <iostream>
#include <fstream>
#define MOD 1999999973
using namespace std;
int ridicare(int n, int p) {
if (p == 0)
return 1;
else if (p == 1)
return n % MOD;
else
if (p % 2 == 0)
return ridicare(((n % MOD) * (n % MOD)) % MOD, p / 2) % MOD;
else
return ((n % MOD) * ridicare(((n % MOD) * (n % MOD)) % MOD, p / 2)) % MOD;
}
int ridicare2(int n, int p) {
int y = 1;
while (p > 1) {
if (p % 2 == 0) {
n = ((n % MOD) * (n % MOD)) % MOD;
p = p / 2;
} else {
y = ((y % MOD) * (n % MOD)) % MOD;
n = ((n % MOD) * (n % MOD)) % MOD;
p = p / 2;
}
}
return ((y % MOD) * (n % MOD)) % MOD;
}
int main() {
int n;
int p;
ifstream fi("lgput.in");
ofstream fo("lgput.out");
fi >> n >> p;
fo << ridicare2(n, p);
fi.close();
fo.close();
return 0;
}