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