PAT 甲级1010 Radix (25 分)

1010 Radix 25 )

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

 

题目大意:

  给定两个数N1、 N2 ; 一个标记 tag 和一个基 radix。当tag == 1 时 radix 是第一个数N1的基;tag == 2 则是第二个数。如果两个数在某个基下相等,则输出另一个未给出的基。否则输出Impossible。

 

思路:

  注意到即便用long long型也会溢出。题目给出的两个数是不会溢出的,但是没有写明。

  思路是将两个数都转化为十进制,再用二分法找另一个数的基。

 

参考代码:

#include<string>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
string f1, f2;
ll tag, radix;
ll change(string & s, ll r){
	ll ans = 0;
	for(int i = 0; i < s.size(); ++i)
		ans = ans * r + ( isdigit(s[i])? s[i] - '0': s[i] - 'a' + 10 ); 
	return ans;
}
ll find_radix(string & s, ll num){
	char c = *max_element(s.begin(), s.end());
	ll l =  (isdigit(c)? c - '0': c - 'a' + 10) + 1;
	ll r = max(l, num);
	while(l <= r){
		ll mid = (l + r) / 2;
		ll temp = change(s, mid);
		if(temp < 0 || temp > num)	r = mid - 1;
		else if(temp == num)	return mid;
		else	l = mid + 1; 
	}
	return -1;
}
int main(){
	cin >> f1 >> f2 >> tag >> radix;
	if(tag == 2)	swap(f1, f2);
	ll ans = find_radix(f2, change(f1, radix));
	if(ans == -1)	printf("Impossible");
	else	printf("%lld", ans);
	return 0;
}

代码参考了:https://blog.csdn.net/liuchuo/article/details/52495925

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值