1)快速幂算法:用分治法求a的n次方,要求输出a的n次方的值
#include<iostream>
using namespace std;
long long kuaisumi(long long a,long long b ){
//a为底数,b为指数,c用来承载分离出来的底数
long long c=1;
while(b>0){
if(b%2==0){//判断b的奇偶
b=b/2;
a=a*a;
}else{
b=b-1;
c=a*c;
}
}
return c;
}
int main(){
long long a,b;
cout<<"请输入底数";
cin>>a;
cout<<"请输入指数";
cin>>b;
cout<<kuaisumi(a,b)<<endl;