2031.cpp

杭州电子科技大学ACM-OJ系统的部分代码

/*#include<iostream>
#include<stack>
using namespace std;
int main()
{int a,b,c;
while(cin>>a>>b)
{stack<int> s;
if(a<0){cout<<"-";a=-a;}
if(a==0||a==-0)cout<<0;
while(a>0)
{ c=a%b;a=a/b;
s.push(c);}
while(!s.empty())
{ if(s.top()>=10){char c=s.top()-10+'A';cout<<c;}
  else{cout<<s.top();}
 s.pop();
}cout<<endl;
}
return 0;
}
*/
#include<iostream>
using namespace std;
//int a[33];
char b[33];
int main()
{
    char digit[17]="0123456789ABCDEF";
	int n,r;
	while(cin>>n>>r)
	{
		int flag=0;
		if(n<0)
		{
			flag=1;
			n=-n;
		}
		int i=0;
		while(n>0)
		{
            b[i++]=digit[n%r];
		    n=n/r;
                        /*
			a[++i]=n%r;
			if(a[i]>=10)
			        b[i]=a[i]+'0'+7;
			else
				b[i]=a[i]+'0';
			n=n/r;
                        */

		}
		if(flag==1)
		     cout<<"-";
		for(int j=i-1;j>=0;j--)
		     cout<<b[j];
		cout<<endl;

	}
	return 0;
}

/*
#include<iostream>
using namespace std;
int a[33];
char b[33];
int main()
{
	int n,r;
	while(cin>>n>>r)
	{
		int flag=0;
		if(n<0)
		{
			flag=1;
			n=-n;
		}
		int i=0;
		while(n>=r)
		{
			a[++i]=n%r;
			if(a[i]>=10)
			    b[i]=a[i]+'0'+7;
			else
				b[i]=a[i]+'0';
			n=n/r;
		}
		if(n>=10)
			b[i+1]=n+'0'+7;
		else
			b[i+1]=n+'0';
		if(flag==1)
			cout<<"-"<<b[i+1];
		else
		    cout<<b[i+1];
		for(int j=i;j>0;j--)
			cout<<b[j];
		cout<<endl;

	}
	return 0;
}
although it has ACed,the next is easier.
*/