Pagini recente » Cod sursa (job #140346) | Cod sursa (job #663515) | Cod sursa (job #2943865) | Cod sursa (job #1864383) | Cod sursa (job #2588644)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const long long MOD = 1999999973;
long long ridicarePutere(long long x, long long n) {
if (n == 0)
return 1;
if (n == 1)
return x % MOD;
if(n % 2 == 0)
return ridicarePutere(x * x % MOD, n / 2) % MOD;
if (n % 2 == 1)
return x % MOD * ridicarePutere(x * x % MOD, (n - 1) / 2) % MOD;
return 0;
}
int main(int argc, const char * argv[]) {
long long n, p;
fin >> n >> p;
fout << ridicarePutere(n, p) % MOD;
}