[ PAT-A ] 1010 Radix (C++)

最新推荐文章于 2022-02-19 18:25:39 发布

顾_wolf

最新推荐文章于 2022-02-19 18:25:39 发布

阅读量475

点赞数

分类专栏： [算法编程]PAT-A 文章标签： PAT algorithm

本文链接：https://blog.csdn.net/S_zhicheng27/article/details/81235973

版权

[算法编程]PAT-A 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

题目描述

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is “yes”, if 6 is a decimal number and 110 is a binary number.
Now for any pair of positive integers N1 and N2, your task is to find the radix of one number while that of the other is given.

Input Specification:
Each input file contains one test case. Each case occupies a line which contains 4 positive integers:\ N1 N2 tag radix\ Here N1 and N2 each has no more than 10 digits. A digit is less than its radix and is chosen from the set {0-9, a-z} where 0-9 represent the decimal numbers 0-9, and a-z represent the decimal numbers 10-35. The last number “radix” is the radix of N1 if “tag” is 1, or of N2 if “tag” is 2.

Output Specification:
For each test case, print in one line the radix of the other number so that the equation N1 = N2 is true. If the equation is impossible, print “Impossible”. If the solution is not unique, output the smallest possible radix.

Sample Input 1:
6 110 1 10

Sample Output 1:
2

Sample Input 2:
1 ab 1 2

Sample Output 2:
Impossible

解题思路

题目大意为给定两个数,只知道其中一个数字对应的进制,如果要使两个数相同,则另一个数对应的进制应该是多少?

将已知进制的数转为十进制数
找到令两个数值相等的进制数。在查找的过程中，使用二分查找算法

代码设计

1.进制转换模块

[任务]
将m进制的数ss转为10进制数
[说明]
有两种方法,一种从低位开始,另一种从高位出发,此次采用后者
[接口]
long long int transform(string ss,long long m)
输入: ss: m进制的数ss ; m : 表示ss对应的进制
输出: 返回其对应的十进制数

//zhicheng
long long int transform(string ss,long long m)
{
    long long int sum=0;
    for(int i=0;i<ss.length();i++)
    {
        if(ss[i]>='0'&&ss[i]<='9') sum=sum*m+ss[i]-'0';
        else sum=sum*m+ss[i]-'a'+10;
    }
    return sum;
}

2.查找模块

[任务]
找到令两个数值相等的进制数,即如果s2对应的十进制数等于num,返回s2对应的进制,否则返回-1
[说明]
在查找的过程中，使用二分查找算法
[接口]
long long find_radix(long long int num,string s2)
输入: num 十进制数 ; s2: 未知进制的数
输出: s2对应的十进制数等于num,返回s2对应的进制,否则返回-1

//zhicheng
long long find_radix(long long int num,string s2)
{
    char it=*max_element(s2.begin(),s2.end());
    long long low=(isdigit(it)?it-'0':it-'a'+10)+1;
    long long high=max(num,low);
    while(low<=high)
    {
        long long mid=(low+high)/2;
        long long t=transform(s2,mid);
        if(t<0||t>num) high=mid-1;// 溢出或者过大
        else if(t==num) return mid;
        else low=mid+1;
    }
    return -1;
}