#include<iostream>#include<cstring>#include<algorithm>#include<cstdlib>#include<vector>#include<cmath>#include<stdlib.h>#include<iomanip>#include<list>#include<deque>#include<map>#include <stdio.h>#include <queue>
#define maxn 10000+5#define ull unsigned long long#define ll long long#define reP(i,n) for(i=1;i<=n;i++)#define rep(i,n) for(i=0;i<n;i++)#define cle(a) memset(a,0,sizeof(a))#define mod 90001#define PI 3.141592657
const ull inf = 1LL << 61;const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){return a>b;}
int main(){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);int n,r,p,b,q;char a[maxn];char c;while(cin>>n>>r){if(n<0)p=-n;else if(n>0)p=n;for(int i=1;;i++){b=p%r;p=p/r;if(b>=10){c=(b-10)+'A';a[i]=c;}elsea[i]=b+'0';if(p==0){ q=i;break;}}if(n<0)cout<<"-";for(int i=q;i>=1;i--)cout<<a[i];cout<<endl;}return 0;}
杭电2031题
最新推荐文章于 2023-03-02 17:04:55 发布