Pagini recente » Cod sursa (job #3160256) | Cod sursa (job #559706) | Cod sursa (job #1895116) | Cod sursa (job #3254021) | Cod sursa (job #1217891)
#include<fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
#define mod 1999999973
#define ll long long
ll a,n;
ll mult(ll a, ll b)
{
return ((a%mod)*(b%mod))%mod;
}
ll binpow(ll a, ll n)
{
ll res=1;
while (n)
{
if (n%2==1)
{
res=mult(res,a);
n--;
}
a=mult(a,a);
n/=2;
}
return res;
}
int main()
{
cin>>a>>n;
cout<<binpow(a,n);
return 0;
}