Pagini recente » Cod sursa (job #1993532) | Cod sursa (job #2934955) | Cod sursa (job #2174005) | Cod sursa (job #924302) | Cod sursa (job #2139619)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
const int modulo=1999999973;
long long n,q;
int main()
{
long long p=1;
in>>n>>q;
while(q!=0)
{
if(q%2==1)
p=(p*n)%modulo;
q=q/2;
n=n*n%modulo;
}
out<<p;
/*
a^35 = a^1 * a^2 * a^32
a^2, a^4, a^8...
while (n != 0){
if (n % 2 != 0) {
p *= a;
}
n /= 2;
a *= a;
}
*/
return 0;
}