UVa343 What Base Is This

最新推荐文章于 2019-04-06 13:51:12 发布

原创最新推荐文章于 2019-04-06 13:51:12 发布 · 760 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#input #include

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文介绍了一个用于判断两个字符串在2到36之间的相同基数下是否相等的C语言程序。该程序通过逐字符分析输入的字符串来确定其可能的最大基数，并在此基础上进行数值转换比较。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#include <string.h>
#include <ctype.h>
#define N 100
#define END 37
int main()
{
char input1[N], input2[N];
int base1, base2;
int i;
int max1, max2;
int num1, num2;
int flag;
#ifndef ONLINE_JUDGE
freopen("d:\\uva_in.txt", "r", stdin);
#endif
while (scanf("%s%s", input1, input2) == 2) {
max1 = 2, max2 = 2;;
for (i = 0; i < strlen(input1); i++) {
if (isdigit(input1[i]) && (input1[i] - '0') >= max1)
max1 = input1[i] - '0' + 1;
else if (isalpha(input1[i]) && (input1[i] - 'A' + 10) >= max1)
max1 = input1[i] - 'A' + 10 + 1;
}
for (i = 0; i < strlen(input2); i++) {
if (isdigit(input2[i]) && (input2[i] - '0') >= max2)
max2 = input2[i] - '0' + 1;
else if (isalpha(input2[i]) && (input2[i] - 'A' + 10) >= max2)
max2 = input2[i] - 'A' + 10 + 1;
}
flag = 0;
for (base1 = max1; base1 < END; base1++) {
for (i = 0, num1 = 0; i < strlen(input1); i++) {
if (isdigit(input1[i]))
num1 = num1 * base1 + (input1[i] - '0');
else
num1 = num1 * base1 + (input1[i] - 'A' + 10);
}
for (base2 = max2; base2 < END; base2++) {
for (i = 0, num2 = 0; i < strlen(input2); i++) {
if (isdigit(input2[i]))
num2 = num2 * base2 + (input2[i] - '0');
else
num2 = num2 * base2 + (input2[i] - 'A' + 10);
}
if (num1 == num2) {
flag = 1;
break;
} else if (num2 > num1)
break;
}
if (flag)
break;
}
if (flag) {
printf("%s (base %d) = %s (base %d)\n", input1, base1, input2, base2);
} else {
printf("%s is not equal to %s in any base 2..36\n", input1, input2);
}
}
return 0;
}