Pagini recente » Cod sursa (job #2810889) | Cod sursa (job #842842) | Cod sursa (job #835360) | Cod sursa (job #1124311) | Cod sursa (job #1979663)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int n, p;
ifstream f("lgput.in");
ofstream g("lgput.out");
int Power(int n, int p)
{
long long rez = 1;
while (p)
{
if (p % 2)
{
rez = (1LL * rez * n) % MOD ;
n--;
}
p /= 2;
n = (1LL * n * n) % MOD;
}
return rez;
}
int main()
{
f >> n >> p;
g << Power(n, p) << "\n";
return 0;
}