Pagini recente » Istoria paginii problema/volei | Cod sursa (job #1648067) | Cod sursa (job #1719074) | Cod sursa (job #735806) | Cod sursa (job #2723017)
#include <bits/stdc++.h>
using namespace std;
ifstream fcin("lgput.in");
ofstream fcout("lgput.out");
int cautare_binara(int v[],int n, int x)
{
int s=1,d=n,m;
while(s<d){
m=(s+d)/2;
// cout<<'-'<<m<<endl;
if(v[m]==x)
return m;
else if(x>v[m]){
s=m+1;
}
else{
d=m-1;
}
}
if(v[s]==x)
return s;
return 0;
}
int main()
{
int x,p;
long long a=1;
fcin>>x>>p;
for(int i=1;i<=p;i++){
a*=x;
}
fcout<<a;
return 0;
}