Pagini recente » Cod sursa (job #2490214) | Cod sursa (job #727320) | Cod sursa (job #1899397) | Cod sursa (job #1938802) | Cod sursa (job #3326641)
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int main()
{
ifstream in("lgput.in");
ofstream out("lgput.out");
int a, n;
in >> a >> n;
int p = 1;
while (n != 0)
{
int cif = n % 2;///n & 1
if (cif != 0)
{
p = (long long)p * a % MOD;
}
a = (long long)a * a % MOD;
n /= 2;///n >>= 1
}
out << p << "\n";
in.close();
out.close();
return 0;
}