Pagini recente » Monitorul de evaluare | Istoria paginii runda/runda_ezoterica_4 | Cod sursa (job #2001112) | Cod sursa (job #3285969) | Cod sursa (job #2871856)
#include "bits/stdc++.h"
using namespace std;
int mod = 1999999973;
int sum(int n){
int s = 0;
n = abs(n);
while(n!=0){
s+=n%10;
n/=10;
}
return s;
}
int pw(int a, int b){
if(b == 0) return 1;
if(b %2 == 0) return a*pw(a,b/2);
mod = b%2;
return pow(a, mod+1)*pw(a, b/2);
}
int main()
{
ifstream in;
in.open("lgput.in");
ofstream out;
out.open("lgput.out");
int a, b;
in>>a>>b;
out<<pw(a, b);
//cout<<pow(2, 30);
}