题目:进制转换
解法:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long nums, k;
void solution(long long nums, long long k)
{
vector<int> res;
while(nums)
{
long long curr = nums % k;
res.push_back(curr);
nums /= k;
}
reverse(res.begin(), res.end());
for(auto c : res)
cout << c;
}
int main()
{
cin >> nums >> k;
if(nums == 0)
{
cout << 0;
return 0;
}
solution(nums, k);
}