揭秘加法表：破解字母数字对应关系与进制之谜

```python n = int(input()) table = [input().split() for _ in range(n)] letters = table[0][1:] letter_count = len(letters) # 生成所有可能的数字排列 from itertools import permutations all_permutations = permutations(range(letter_count)) def letter_to_num(letter, mapping): return mapping[letters.index(letter)] def num_to_letter(num, mapping): return letters[list(mapping).index(num)] def convert_to_decimal(num_str, mapping, base): result = 0 power = 0 for char in reversed(num_str): result += letter_to_num(char, mapping) * (base power) power += 1 return result def convert_from_decimal(num, mapping, base): if num == 0: return num_to_letter(0, mapping) result = "" while num > 0: remainder = num % base result = num_to_letter(remainder, mapping) + result num //= base return result for mapping in all_permutations: base = letter_count valid = True for i in range(1, n): for j in range(1, n): left = letter_to_num(table[i][0], mapping) right = letter_to_num(table[0][j], mapping) sum_decimal = left + right expected = convert_from_decimal(sum_decimal, mapping, base) if expected != table[i][j]: valid = False break if not valid: break if valid: output1 = " ".join([f"{letter}={letter_to_num(letter, mapping)}" for letter in letters]) print(output1) print(base) break else: print("ERROR!") ``` ######[AI问答 | 431点数解答 | 2025-12-13 11:11:40]