Pagini recente » Diferente pentru happy-coding-2007/solutii intre reviziile 19 si 18 | Cod sursa (job #2482931) | Cod sursa (job #1415400) | Cod sursa (job #1415388) | Cod sursa (job #2482927)
#include <bits/stdc++.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n,k;
int powlg(long long n,long long k)
{
if(k==0)return 1;
else if(k==1)return n;
else if(k%2)return n*powlg(n*n,(k-1)/2);
else return powlg(n*n,k/2);
}
int main()
{
f>>n>>k;
g<<powlg(n,k);
g.close();
f.close();
return 0;
}