Pagini recente » Cod sursa (job #2719916) | Cod sursa (job #2868753) | Cod sursa (job #3148494) | Cod sursa (job #1201348) | Cod sursa (job #2091049)
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
const int MOD = 1999999973;
int main()
{
long long int n,p,cop, sol = 1, v[33];
in>>n>>p;
in.close();
cop = n;
v[0] = 1;
for(int i=1;i<=32;i++)
v[i] = v[i - 1] * 2;
for(unsigned int i=0;v[i]<=p;++i){
if((v[i]&p) > 0)
sol = (sol * cop) % MOD;
cop = (cop * cop) % MOD;
}
out<<sol<<"\n";
out.close();
return 0;
}