【PAT Advanced Level】1010. Radix (25)

最新推荐文章于 2023-08-11 11:29:15 发布

gzxcyy

最新推荐文章于 2023-08-11 11:29:15 发布

阅读量746

点赞数

分类专栏： PAT Advanced Level c++

本文链接：https://blog.csdn.net/gzxcyy/article/details/12994535

版权

c++ 同时被 2 个专栏收录

56 篇文章 0 订阅

订阅专栏

PAT Advanced Level

32 篇文章 0 订阅

订阅专栏

这题参考了别人的代码，我写的总是有几个case过不去，也懒得找错误了。

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

long num2Dec(char *,int);//转换成10进制数据
long findLowRadix(char *);//寻找最低进制数
long binarysearch(char *,long ,long, long);
int main()
{
	char N1[11],N2[11];
	int tag,radix;
	long target = 0L,result=0L;
	long least;//进制最小
	long most;//进制最大
	scanf("%s%s",N1,N2);
	scanf("%d%d",&tag,&radix);

	if(1 == tag)
	{
		target = num2Dec(N1,radix);
		least=findLowRadix(N2);
		most = (target + 1 > least + 1) ? target +1 :least +1; 
		result = binarysearch(N2,least,most,target);
		if(result == -1)
			printf("Impossible");
		else
			printf("%d\n",result);
	}else if(2 == tag)
	{
		target = num2Dec(N2,radix);
		least=findLowRadix(N1);
		most = (target + 1 > least + 1) ? target +1 :least +1; 
		result = binarysearch(N1,least,most,target);
		if(result == -1)
			printf("Impossible");
		else
			printf("%d\n",result);
	}

	return 0;
}
long num2Dec(char *p,int radix)
{
	int len = strlen(p);
	int m=1,num=1,sum=0;
	int i=0;
	for(i=len-1;i>=0;i--)
	{
		if(p[i]>='a' && p[i]<='z')
			num = p[i]-'a' + 10;
		else if(p[i] >= '0' && p[i] <= '9')
			num = p[i]-'0';
		sum += num*m;
		m*=radix;
	}
	return sum;
}

//ab:最小就是12进制  69：最小就是10进制
long findLowRadix(char *p)
{
	long len=strlen(p),low=0,num=0,i=0;  

	for(i=len-1;i>=0;i--)  
	{  
		if(p[i]>='a'&&p[i]<='z')  
			num= p[i] - 'a' + 10;  
		else if(p[i]>='0'&& p[i]<='9')  
			num=p[i] - '0';  
		if(num+1>low)  
			low=num+1;  
	}  

	return low;  
}
long binarysearch(char *p,long low,long high,long target)
{
	long mid=low,tmp=0;
	while(low<=high)
	{
		tmp = num2Dec(p,mid);
		if(tmp > target)
			high=mid-1;
		else if(tmp < target)
			low = mid+1;
		else 
			return low;
		mid = (low+high)/2;
	}
	return -1;
}