HDU 1335 Basically Speaking

    xiaoxiao2025-06-08  15

    Basically Speaking

    Problem Description The Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the company that it would be neato if this new calculator could convert among number bases. The company thought this was a stupendous idea and has asked your team to come up with the prototype program for doing base conversion. The project manager of the Super Neato Model I calculator has informed you that the calculator will have the following neato features: It will have a 7-digit display. Its buttons will include the capital letters A through F in addition to the digits 0 through 9. It will support bases 2 through 16.   Input The input for your prototype program will consist of one base conversion per line. There will be three numbers per line. The first number will be the number in the base you are converting from. The second number is the base you are converting from. The third number is the base you are converting to. There will be one or more blanks surrounding (on either side of) the numbers. There are several lines of input and your program should continue to read until the end of file is reached.   Output The output will only be the converted number as it would appear on the display of the calculator. The number should be right justified in the 7-digit display. If the number is to large to appear on the display, then print "ERROR'' (without the quotes) right justified in the display.   Sample Input 1111000 2 10 1111000 2 16 2102101 3 10 2102101 3 15 12312 4 2 1A 15 2 1234567 10 16 ABCD 16 15   Sample Output 120 78 1765 7CA ERROR 11001 12D687 D071

    题意:输入三个数,n,a,b,表示当前n是a进制的数,要求把n转换成b进制输出。超过7位则输出ERROR。

    注意输出格式和字符串长度限制,开数组的大小,我开始就因为数组开小了,错了好多次。

    #include<cstring> #include<cstdio> #include<cmath> using namespace std; int b[27],len; char a[10]; int main() { int n,m; memset(b,0,sizeof(b)); while(~scanf("%s",a)) { len=strlen(a); scanf("%d%d",&n,&m); int t=1; for(int i=0;i<len;i++) { if(a[i]>='0' &&a[i]<='9') b[i]=a[i]-='0'; else if(a[i]>='A'&&a[i]<='F') b[i]=a[i]-55; } int sum=0; for(int i=len-1;i>=0;i--) { sum+=(b[i])*t; t*=n; } int k=0; while(sum) { b[k++]=sum%m; sum/=m; } if(k>7) { printf(" ERROR\n"); continue; } for(int i=0;i<k;i++) { if(b[i]>=0 &&b[i]<=9) a[i]=char(b[i]+'0'); else a[i]=char(b[i]+55); } for(int i=k;i<7;i++) printf(" "); for(int i=k-1;i>=0;i--) printf("%c",a[i]); printf("\n"); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); } return 0; }

    转载请注明原文地址: https://ju.6miu.com/read-1299738.html
    最新回复(0)