提交时间:2023-12-30 10:44:17

运行 ID: 118397

#include<bits/stdc++.h> #define MAXN 1000 using namespace std; int Stack[1005]; int Top=1; char c[36]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; int StackEmpty() { return Top<0?1:0; } char Pop(){ return c[Stack[Top--]]; } void Push(int value) { Stack[++Top]=value; } void conversion(int number,int d) { for(;number;number/=d)Push(number%d); while(!StackEmpty())cout<<c[Stack[Top--]]; } int main(){ int number,d; cin>>number; cin>>d; if(number==0)cout<<0<<endl; else{ conversion(number,d); cout<<endl; } return 0; }