Submission

Score: 100

User: C12

Problemset: Base Converter

Language: cpp

Time: 0.002 second

Submitted On: 2026-01-05 08:29:14

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
// ll mod = 1000000007;

void solve(){

    ll n,base;

    cin >> n >> base;

    ll i = 0;
    while(pow(base,i) < n){
        i++;
    }
    i--;
    ll out,num;
    num = ceil(pow(base,i));
    // cout << base << ' ' << i << ' ' << pow(base,i) << ' ' << num << '\n';
    for(int j = i;j >= 0;j--){
        if(n > 0){
            out = n/num;
        }
        else{
            out = 0;
        }
        n -= out*num;

        cout << out;
        // cout << '\n' << num << ' ' << n << '\n';

        num /= base;
    }
    
    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    // cin >> q;

    // while(q--)
        solve(); 

    return 0;
}