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.
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.
/*
代码的作用是十进制的n转换成k进制的数字，
https://blog.csdn.net/qq_23109971/article/details/111396755
*/
# include <bits/stdc++.h>
using namespace std ;
const int N = 10010 ;
int n , ans , k , len = 1 ; //最少是1位长度
int d [ N ] ;
int main ( ) {
cin > > n > > k ; // n： ，
//从0开始枚举每小于n的数字，
for ( int i = 0 ; i < n ; i + + ) {
+ + d [ 0 ] ; //将叠加上来的1先放到个位上
for ( int j = 0 ; j < len - 1 ; j + + ) //看看会不会对现在的每一个位置造成进位？
if ( d [ j ] = = k ) {
d [ j ] = 0 ;
d [ j + 1 ] + = 1 ;
+ + ans ; //记录进位次数
}
//最高位单独处理
if ( d [ len - 1 ] = = k ) {
d [ len - 1 ] = 0 ;
d [ len ] = 1 ;
+ + len ;
+ + ans ;
}
//输出k进制的表示法
// for (int i = len - 1; i >= 0; i--) cout << d[i];
// cout << endl;
}
//输出进位次数
// cout << ans << endl;
cout < < len < < endl ;
//输出k进制的表示法
// for (int i = len - 1; i >= 0; i--) cout << d[i];
// cout << endl;
return 0 ;
}
