Pagini recente » Cod sursa (job #1525127) | Cod sursa (job #224783) | Cod sursa (job #1320266) | Cod sursa (job #826987) | Cod sursa (job #2344574)
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
ifstream in("lgput.in");
ofstream out("lgput.out");
const int MOD = 1999999973;
ll n, p;
ll res = 1;
int main()
{
in >> n >> p;
for(int i = 0; (1 << i) < p; i++) {
if(0 < ((1 << i) & p))
res = (res * n) % MOD;
n = (n * n) % MOD;
}
out << res << '\n';
in.close();
out.close();
return 0;
}