不同列表之间的全排列以及进制问题

最近做的一道编程题：第一行输入数据的位数，第后面每行表示每一位的进制数，10用A表示，11用B表示，12用C表示，13用D表示，14用E，15用E表示：
北京四达时代编程第二题：

board = {2: ['0', '1'], 3: ['0', '1', '2'], 4: ['0', '1', '2', '3'], 5: ['0', '1', '2', '3', '4'], 6: ['0', '1', '2', '3', '4', '5'], 7: ['0', '1', '2', '3', '4', '5', '6'], 8: ['0', '1', '2', '3', '4', '5', '6', '7'], 9: ['0', '1', '2', '3', '4', '5', '6', '7', '8'],10: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9'],
        11: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A'], 12: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B'],13: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C'],14: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D'],15: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D','E'],16: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D','E','F']
         }

import itertools
num = int(input())
row = []
for i in range(num):
    row.append(int(input()))
output = []
for i in row:
    output.append(board[i])
res = list(itertools.product(*output))
for i in res:
    number = ''.join(i)
    number = number.lstrip('0')
    print(number)

方法2：深度优先搜索

coding='utf8'

board = {2: ['0', '1'], 3: ['0', '1', '2'], 4: ['0', '1', '2', '3'], 5: ['0', '1', '2', '3', '4'], 6: ['0', '1', '2', '3', '4', '5'], 7: ['0', '1', '2', '3', '4', '5', '6'], 8: ['0', '1', '2', '3', '4', '5', '6', '7'], 9: ['0', '1', '2', '3', '4', '5', '6', '7', '8'],10: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9'],
        11: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A'], 12: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B'],13: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C'],14: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D'],15: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D','E'],16: ['0', '1', '2', '3', '4', '5', '6', '7', '8','9','A','B','C','D','E','F']
         }
def combination(*args: list):
    config = [e for e in args]
    res = []
    tmp = []
    dfs(res, tmp, config, 0)
    return res


# dfs没变动
def dfs(res=[], tmp=[], config=[], i=0):
    if i == len(config):
        res.append(tmp.copy())
    else:
        for e in config[i]:
            # change spot
            tmp.append(e)
            # new condition,new recursion
            dfs(res, tmp, config, i + 1)
            # restore spot
            tmp.pop(len(tmp) - 1)

if __name__ == '__main__':
    num = int(input())
    row = []
    for  i in range(num):
        row.append(int(input()))
    # print(num)
    # print(row)
    output = []
    for i in row:
        output.append(board[i])
    # print(output)
    res = combination(*output)
    for i in res:
        number = ''.join(i)
        number = number.lstrip('0')
        print(number)

样例测试都过了，就是考试的时候少了number = number.lstrip(‘0’)，导致没有得到所有的分数