Pagini recente » Cod sursa (job #1453406) | Cod sursa (job #3004857) | Cod sursa (job #306112) | Cod sursa (job #1879042) | Cod sursa (job #1733301)
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("lgput.in");
ofstream t ("lgput.out");
unsigned long long x,y;
const long long mod=1999999973;
/*long long powerlift (long long n)
{
long long x1=x%mod;
for (int i=0; i<n; ++i)
x1*=x1%mod;
return x1%mod;
}*/
void magic()
{
long long n=1;
/* bitset <65> v(y);
for (int i=0; i<64; ++i)
if (v[i])
n*=powerlift(i)%mod;
t<<n%mod;
}*/
while(y)
{
if(y&1)
{
n=(n*x)%mod;
}
x=(x*x)%mod;
y>>=1;
}
t<<n%mod;
}
int main()
{
f>>x>>y;
magic();
return 0;
}