You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

39 lines
964 B

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

#include <bits/stdc++.h>
using namespace std;
// 代码的作用是十进制的n转换成k进制的数字len为结果的长度
const int N = 10010;
int n; // 要转换的10进制数
int k; // k进制
int len = 1; // 最少是1位长度,目前转换到的长度
int d[N]; // 保留结果的数组
int main() {
cin >> n >> k;
//从0开始枚举每小于n的数字一个个叠加上去
for (int i = 0; i < n; i++) {
++d[0]; //将叠加上来的1先放到个位上
//已有的每一个数位都有可能产生进位注意从下标从0开始
for (int j = 0; j < len - 1; j++)
if (d[j] == k) {
d[j] = 0;
d[j + 1] += 1;
}
//最高位单独处理
if (d[len - 1] == k) {
d[len - 1] = 0;
d[len] = 1;
++len;
}
}
//输出k进制的表示法
for (int i = len - 1; i >= 0; i--) cout << d[i];
cout << endl;
return 0;
}