有理。我修正一下:
[Python] 纯文本查看 复制代码 total_unit = 100
for i in range(1, 19): # N进制每个位需要N-1个单元
unit_used = i
max_val = i
while (unit_used + i) <= total_unit:
max_val *= (i + 1) # 左移乘以进制
max_val += i # 加上个位最大值
unit_used += i
if i != 9:
print("%02d"%(i + 1), "---", "0x%X" % max_val) # 十六进制
else:
print("%02d"%(i + 1), "---", max_val) # 十进制
02 --- 0xFFFFFFFFFFFFFFFFFFFFFFFFF
03 --- 0x980553F0DB2FD09DE3C8
04 --- 0x3FFFFFFFFFFFFFFFF
05 --- 0x422CA8B0A00A424
06 --- 0xCFD41B90FFFFF
07 --- 0x1E39A5057D80
08 --- 0x3FFFFFFFFFF
09 --- 0x41C21CB8E0
10 --- 99999999999
11 --- 0x609FDB0D8
12 --- 0x1338BFFFF
13 --- 0x309F1020
14 --- 0x6487B7F
15 --- 0xA2F1B6E
16 --- 0xFFFFFF
17 --- 0x1704F60
18 --- 0x1CD51F
19 --- 0x25C842
|