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