Pagini recente » Borderou de evaluare (job #1551104) | Cod sursa (job #627485) | Cod sursa (job #2902513) | Cod sursa (job #2746650) | Cod sursa (job #2545911)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int MOD = 1999999973;
ll lgput(ll n, ll p){
if(!p)return 1;
if(p & 1)
return n * lgput(n, p - 1);
return lgput(n * n, p / 2);
}
int main(){
ifstream cin("lgput.in");
ofstream cout("lgput.out");
ll n, p;
cin >> n >> p;
cout << lgput(n, p) << '\n';
cin.close(), cout.close();
}