Pagini recente » Cod sursa (job #1995296) | Cod sursa (job #2243872) | Cod sursa (job #2986229) | Cod sursa (job #2946083) | Cod sursa (job #1618020)
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
long long int n, p;
int Pow(int n, int p);
int main() {
fin >> n >> p;
fout << Pow(n, p);
fin.close();
fout.close();
return 0;
}
int Pow(int n, int p) {
if (p == 0) return 1;
int x = (1LL * (Pow(n, p / 2) % MOD) * (Pow(n, p / 2) % MOD)) % MOD;
if (p % 2 == 1) x = (1LL * x * n) % MOD;
return x;
}