Pagini recente » Cod sursa (job #2334639) | Cod sursa (job #1239651) | Cod sursa (job #2192468) | Cod sursa (job #2230636) | Cod sursa (job #2834296)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("igput.in");
ofstream cout("igput.out");
int b,n,p;
int moduloP=1;
void read(){
cin>>b>>n;
//>>p;
moduloP=1999999973;
// while(p>0){
// moduloP*=10;
// p--;
// }
}
long calculate(int base,int exp){
///base cond
if(exp==1){
return base;
}
///recursive function
if(exp%2==0){
return calculate(base*base,exp/2)%moduloP;
}
else{
return (base*calculate(base,exp-1))%moduloP;
}
}
void solve(){
int number=1;
while(n>1){
if(n%2==1){
number*=b;
n--;
}
else{
b*=2;
n/=2;
}
}
cout<<number*b;
}
int main() {
read();
cout<<calculate(b,n)%moduloP;
// solve();
return 0;
}