Pagini recente » Cod sursa (job #2305356) | Cod sursa (job #98225) | Cod sursa (job #2808185) | Cod sursa (job #673680) | Cod sursa (job #1527556)
#include <fstream>
using namespace std;
ifstream in ("lgput.in");
ofstream out ("lgput.out");
const int MOD = 1999999973;
int n, p; long long sol;
int lgput (int n, int p)
{
if (p == 0) return 1;
if (p == 1) return n;
if (!(p % 2)) return lgput(n, p/2) % MOD * lgput(n, p/2) % MOD;
if (p % 2) return lgput(n, p/2) % MOD * lgput(n, p/2) % MOD * n % MOD;
}
int main()
{
in >> n >> p;
out << lgput(n, p);
out.close(); return 0;
}