1010. Radix (25)

需要注意这句话：A digit is less than its radix 

使用long long数据才不会溢出

重要的一点：需要用二分法查找才能保证测试点7不超时

不使用二分法的代码：(测试点7超时)

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>  
using namespace std; 
int main()
{ 
char a[11] = { 0 }, b[11] = { 0 };
cin >> a >> b;
int index;
long long rad;
cin >> index >> rad;
if (index == 2)
{
char c[11] = {0};
memcpy(c, a, 11); memcpy(a, b, 11); memcpy(b, c, 11);
}
int i = 0;
while (a[i] != '\0')
{
i++;
}
long long a_sum = 0,rad_a = 1;
for (int j = i-1; j >=0; j--)
{
//0 48 9 57---a 97
int tmp = (int)(a[j]);
if (tmp >= 48 && tmp <= 57)
{
a_sum += ((tmp - 48)*rad_a);

}
else
{
a_sum += ((tmp - 87)*rad_a);
}
rad_a *= rad;
} 
rad = 2; i = 0;
int bb[11] = {0};
int max = 2;
while (b[i] != '\0')
{
int tt = (int)(b[i]);
if (tt >= 48 && tt <= 57)
tt -= 48;
else
{
tt -= 87;
}
bb[i] = tt;
if (tt >= max)
max = tt + 1;
i++;
} 
if (i == 1)
{ 
if (bb[0] != a_sum)
{
cout << "Impossible";
return 0;
}
else
{
cout << max;
return 0;
}
}
rad = max;
while (rad<=a_sum)
{
long long b_sum = 0, rad_b = 1;
for (int j = i-1; j >= 0; j--)
{
b_sum += bb[j] * rad_b;
rad_b *= rad;
} 
if (b_sum > a_sum )
{
cout << "Impossible";
return 0;
}
else if (b_sum == a_sum)
{
cout << rad;
return 0;
}
else
{
rad++;
}
}
cout << "Impossible";
return 0;
}

使用二分法：测试点10错误，原因是溢出错误。修改代码，增加判断 b_sum<0后正确

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>  
using namespace std;
int main()
{
char a[11] = { 0 }, b[11] = { 0 };
cin >> a >> b;
int index;
long long rad;
cin >> index >> rad;
if (index == 2)
{
char c[11] = { 0 };
memcpy(c, a, 11); memcpy(a, b, 11); memcpy(b, c, 11);
}
int i = 0;
while (a[i] != '\0')
{
i++;
}
long long a_sum = 0, rad_a = 1;
for (int j = i - 1; j >= 0; j--)
{
//0 48 9 57---a 97
int tmp = (int)(a[j]);
if (tmp >= 48 && tmp <= 57)
{
a_sum += ((tmp - 48)*rad_a);


}
else
{
a_sum += ((tmp - 87)*rad_a);
}
rad_a *= rad;
}
i = 0;
int bb[11] = { 0 };
int imax = 2;
while (b[i] != '\0')
{
int tt = (int)(b[i]);
if (tt >= 48 && tt <= 57)
tt -= 48;
else
{
tt -= 87;
}
bb[i] = tt;
if ((tt + 1) >imax)
imax = tt + 1;
i++;
}
if (i == 1)
{
if (bb[0] != a_sum)
{
cout << "Impossible";
return 0;
}
else
{
cout << bb[0] + 1;
return 0;
}
}
rad = imax;
long long low = imax;
long long high = a_sum>imax ? (a_sum + 1) : (imax + 1);
rad =  a_sum < 35 ? a_sum : 35;
while (low <= high)
{
long long b_sum = 0, rad_b = 1;
for (int j = i - 1; j >= 0; j--)
{
b_sum += bb[j] * rad_b;
rad_b *= rad;
}
if (b_sum == a_sum)
{
cout << rad;
return 0;
}
else if (b_sum > a_sum || b_sum<0)
{
high = rad - 1;
}
else
{
low = rad + 1;
}
rad = (low + high) / 2;
}
cout << "Impossible";
return 0;
}