#include<stdio.h>
#include<math.h>
using namespace std;
#define MAXN 1000
int Powers[MAXN];
int main() {
int x, n, cnt, i;
int ans = 1;
scanf("%d %d", &x, &n);
cnt = (int)log2(n);
Powers[0] = x;
for (i = 1; i <= cnt; i++)
{
Powers[i] = Powers[i - 1] * Powers[i - 1];
printf("\n\n%d",Powers[i]);
}
i = 0;
while (n > 0) {//将n转换为2进制,如果为1乘
if (n % 2 == 1)
ans *= Powers[i];
i++;
n /= 2;
}
printf("%d", ans);
}
数据结构2.16 快速求幂
猜你喜欢
转载自blog.csdn.net/qing_feng__/article/details/72865528
今日推荐
周排行