题解 | #缩短二进制#

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<string>
using namespace std;
typedef long long LL;
const LL MAXN=1e5+10;
char inttochar(int x){
    if(x<10)return x+'0';
    else return x-10+'A';
}

int main(){
    int x=1234;
    vector<char>shiliu;
       printf("%#o ",1234);
    while(x){
        shiliu.push_back(inttochar(x%16));
        x/=16;
    }
    cout<<"0X";
    for(int i=shiliu.size()-1;i>=0;i--)cout<<shiliu[i];

 return 0;
}