Pagini recente » Cod sursa (job #1300992) | Cod sursa (job #3128432) | Cod sursa (job #264427) | Cod sursa (job #1532359) | Cod sursa (job #3152736)
#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;
cin>>n>>k;
cout<<lgput(n, k);
return 0;
}