Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: kavin8888
Problemset: Base Converter
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-19 13:59:53
#pragma GCC optimize("O3,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
using namespace std;
#define int long long
string s="";
void solve(int n,int base) {
while(n>0) {
s+=((n%base)+'0');
n/=base;
}
reverse(s.begin(),s.end());
cout<<s<<'\n';
return;
}
signed main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,base;
cin>>n>>base;
solve(n,base);
return 0;
}