Pagini recente » Cod sursa (job #935877) | Cod sursa (job #2760433) | Cod sursa (job #2250786) | Cod sursa (job #344835) | Cod sursa (job #745015)
Cod sursa(job #745015)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int b,p,n,i,k,j,m,a[10001],q;
int pow(int n,int k){
int q=1;
if (k==0) return 1;
if (k%2==0){
q=q*pow(n,k/2);
return q*q;
}else return n*pow(n,k-1);
}
int main(){
fin>>n>>k;
//cout<<q<<endl;
fout<<pow(n,k);
//system("pause");
}