//求m的n次方
//假设所有数据都在int范围内
#include<iostream>
using namespace std;
int m_n( int m , int n ){
int k = m;
int t = 1;
int p = 1;
if( n == 0 ){
return 1;
}
while( p <= n ) {
if( ( p & n ) > 0 ) {
t = k * t;
}
k = k * k;
p = p << 1;
}
return t;
}
int main() {
int m , n;
cin >> m >> n;
cout << m_n( m , n ) << endl;
}
求m的n次方
最新推荐文章于 2022-09-07 19:03:51 发布