Pagini recente » Cod sursa (job #12242) | Cod sursa (job #2263380) | Cod sursa (job #2112638) | Cod sursa (job #942629) | Cod sursa (job #1733293)
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("lgput.in");
ofstream t ("lgput.out");
long long x,y;
const long long mod=1999999973;
long long powerlift (long long n)
{
long long x1=x;
for (int i=0; i<n; ++i)
x1*=x1%mod;
return x1%mod;
}
void magic()
{
long long n=1;
bitset <33> v(y);
for (int i=0; i<33; ++i)
if (v[i])
n*=powerlift(i)%mod;
t<<n%mod;
}
int main()
{
f>>x>>y;
magic();
return 0;
}