Pagini recente » Cod sursa (job #2040501) | Cod sursa (job #189689) | Cod sursa (job #2320679) | Cod sursa (job #2744472) | Cod sursa (job #2465838)
#include <fstream>
#include <tuple>
const uint64_t M = 1999999973;
uint64_t solve(uint64_t n, uint64_t p)
{
uint64_t r = 1;
while (p)
{
if (p & 1)
{
r = (r * n) % M;
}
n = (n * n) % M;
p = p >> 1;
}
return r;
}
std::pair<uint64_t, uint64_t> read();
void write(uint64_t r);
int main()
{
uint64_t n, p;
std::tie(n, p) = read();
auto r = solve(n, p);
write(r);
return 0;
}
std::pair<uint64_t, uint64_t> read()
{
std::ifstream fin("lgput.in");
int n, p;
fin >> n >> p;
return std::make_pair(n, p);
}
void write(uint64_t r)
{
std::ofstream fout("lgput.out");
fout << r << '\n';
}