Pagini recente » Borderou de evaluare (job #2506785) | Borderou de evaluare (job #2342019) | Borderou de evaluare (job #1723471) | Borderou de evaluare (job #2686266) | Cod sursa (job #2342012)
#include <iostream>
#define ll long long
#define mod 1999999973
using namespace std;
int a,n;
int lgput(ll a , ll n) {
if (n==1){
return a;
}
if (n==1) {
return 1;
}
if (n%2==1) {
return lgput (a , n-1)*a%mod;
}
else {
return lgput(a , n/2)*lgput(a , n/2)%mod;
}
}
int main()
{
cin >> a >> n;
cout << lgput(a , n);
return 0;
}