pat-1010* Radix

1010: 给出两个数,已知一个数的进制，求是否可以在某进制下两数相等。
如例子一，第一个数为10进制6 110 如果2进制则相等。
Sample Input 1:
6 110 1 10
Sample Output 1:
2
Sample Input 2:
1 ab 1 2
Sample Output 2:
Impossible


不用二分搜索时第7case超时 ，用了二分搜索第10case错误。。。
交了好多遍。。。求正确代码。。。

#include<iostream>
using namespace std;
#include<string.h>

char A[11];
char B[11];
long long least;

long long num2Dec(char * p,long long radix)
{
	long long len=strlen(p);
	long long m = 1;
	long long num = 1;
	long long sum = 0;
	for(long long 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;
}

long long findLowRadix(char *p)
{
	long long len=strlen(p);
	long long low=0;
	long long num;
	for(long long 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;

}

int compare(char* p,long long radix ,long long target)
{
	long long len=strlen(p);
	long long m = 1;
	long long num = 1;
	long long sum = 0;
	for(long long 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;
		if(sum>target)  //avoid  overflow
			return 1;
	}

	if(sum>target)
		return 1;
	else if(sum<target)
		return -1;
	else
		return 0;

}


long long binarySearch(char *p,long long low,long long high,long long top)
{
	long long mid;
	long long tmp;

	while(low<=high)
	{
		mid = (low + high)/2;
        tmp = compare(p,mid,top);
		if(tmp>0)
		{
			high = mid-1;
		}
		else if(tmp<0)
		{
			low = mid +1;
		}
		else
			return mid;
	}
	return -1;
}


int main()
{
	long long tag;
	long long radix;
	long long target;
	long long least; // lowest possible radix
	long long most; // highest possible radix
	long long res;


	cin>>A;
	cin>>B;
	cin>>tag;
	cin>>radix;

	if(1==tag)
	{
		target=num2Dec(A,radix);
		least = findLowRadix(B);
		most = (target + 1 > least + 1) ? target +1 :least +1; 
		res = binarySearch(B,least,most,target);
		if(res==-1)
			cout<<"Impossible"<<endl;
		else
			cout<<res<<endl;

	}
	else if(2==tag)
	{
		target=num2Dec(B,radix);
		least = findLowRadix(A);
		most = (target + 1 > least + 1) ? target +1 :least +1; 
		res = binarySearch(A,least,most,target);
		if(res==-1)
			cout<<"Impossible"<<endl;
		else
			cout<<res<<endl;
	}

}