Pagini recente » Cod sursa (job #2566583) | Cod sursa (job #1923204) | Cod sursa (job #2420996) | Cod sursa (job #345989) | Cod sursa (job #1193888)
#include <fstream>
using namespace std;
int put(int n, int p)
{
if(p == 1) return n;
return put(n, p/2)*put(n, (p + 1)/2) % 1999999973;
}
int main()
{
ifstream in("lgput.in");
ofstream out("lgput.out");
long long n, p, r = 1, n2;
in >> n >> p;
n2 = n;
for(int i = 0; (1 << i) <= p; ++ i) {
if(((1 << i) & p) > 0)
r = (r * n2) % 1999999973;
n2 =(n2 * n2) % 1999999973;
}
out << r;
return 0;
}