Pagini recente » Cod sursa (job #3270649) | Cod sursa (job #71807) | Cod sursa (job #497523) | Cod sursa (job #1227934) | Cod sursa (job #3152737)
#include <fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
int modulo = 1999999973;
/*int lgput(int n, int k)
{
if(k == 0)
return 1;
if(k == 1)
return n;
if(k % 2 == 0)
return (lgput(n, k / 2) * lgput(n, k / 2)) % modulo;
else
return (lgput(n, (k-1) / 2) * lgput(n, (k-1) / 2)) % modulo;
}*/
int main()
{
int n, k, nc;
unsigned long long sol = 1;
cin >> n >> k;
nc = n;
for (int i = 0; (1 << i) <= k; i++)
{
if (((1 << i) & k) > 0)
{
sol = (sol * nc) % modulo;
}
nc = (nc * nc) % modulo;
}
cout<<sol;
return 0;
}