HDU1335：Basically Speaking

最新推荐文章于 2024-03-12 16:00:08 发布

原创最新推荐文章于 2024-03-12 16:00:08 发布 · 1.3k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

水

本文详细介绍了如何为超级便捷计算器设计并实现进制转换功能，包括支持从二进制到十六进制的转换，以及在显示区域正确处理转换后的数值长度不超过7位的规则。

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

题意就是输入一个a进制的数，将他转换为b进制，如果转换后的进制长度超过7，就输出ERROR

#include <stdio.h>
#include <string.h>

int k;
char str[100];

int set(int r,int a,int b)
{
    int i,s = 1;
    for(i = 0; i<b; i++)
        s*=a;
    return s*r;
}

void change(int a,int b)
{
    int num = 0,i,r;
    int len = strlen(str);
    for(i = 0; i<len; i++)
    {
        if(str[i] >= '0' && str[i] <= '9')
            r = str[i] - '0';
        else if(str[i] >= 'A' && str[i] <= 'F')
            r = str[i] - 'A' + 10;
        if(r)
            num+=set(r,a,len-1-i);
    }
    k = 0;
    while(num)
    {
        r = num%b;
        if(r < 10 && r >=0)
            str[k++] = r+'0';
        else
            str[k++] = r+55;
        num/=b;
    }
}

int main()
{
    int a,b,i;
    while(~scanf("%s%d%d",str,&a,&b))
    {
        change(a,b);
        if(k>7)
        {
            printf("  ERROR\n");
            continue;
        }
        for(i = 1; i<=7-k; i++)
        {
            printf(" ");
        }
        for(i = k-1; i>=0; i--)
        {
            printf("%c",str[i]);
        }
        printf("\n");
    }

    return 0;
}

标签

#ACM #解题报告 #HDU #进制