Pagini recente » Cod sursa (job #2441539) | Cod sursa (job #1212690) | Cod sursa (job #292100) | Cod sursa (job #2581381) | Cod sursa (job #2528681)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int lgput(int n, int p)
{
int a = n; //n^(2^i)
int sol = 1;
for (int i = 0; (1 << i) <= p; i++)
{
if ((1 << i) & p)
sol = (sol * a) % MOD;
a *= a;
}
return (sol % MOD);
}
int main()
{
ifstream cin("lgput.in");
ofstream cout("lgput.out");
int n, p;
cin >> n >> p;
cout << lgput(n, p) << "\n";
return 0;
}