#include <bits/stdc++.h>
using namespace std;
int x, y, a[19199], flag;
int main() {
cin >> x >> y;
a[1] = 1;
for (int i = 1; i <= y; i++) {
for (int j = 1; j <= 10100; j++)
a[j] = a[j] * x;
for (int j = 1; j <= 10000; j++) {
while (a[j] >= 10) {
a[j] -= 10;
a[j + 1]++;
}
}
}
for (int i = 10001; i >= 1; i--) {
if ((flag == 1 && a[i] == 0) || a[i] != 0) {
cout << a[i];
flag = 1;
}
}
return 0;
}
高精指数幂
最新推荐文章于 2024-07-20 09:51:47 发布