十进制转任意进制

ten2n.py

code = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'a', 'b', 'c', 'd']


# todo unicode 可以简化这个书写 62个[0-9,a-z,A-Z] 乱序可以制作一个混淆 算是加密算法


def ten2n(x, n):
    b = []
    while True:
        j = x // n
        k = x % n
        b += [k]
        if j == 0:
            break
        x = j
    b.reverse()
    res = [code[item] for item in b]
    return res


if __name__ == '__main__':
    print(ten2n(12311662, 13))