202112-3 登机牌条码（50分）不知道错哪了

有注释，大佬们帮忙看一看

w,s=map(int, input().split()) # w、s分别表示有效数据区每行能容纳的码字数和校验级别
words = input() # 校验的字符串

psd417= [ord(words[i]) for i in range(len(words))] # 用作判断
PSD417 = psd417.copy() # 用作记录
'''
'A'~'Z' = 65~90
'a'~'z' = 97~122 
'0'~'9' = 48~57 
''' 
# 将输入字符串进行编码
big_w = range(65,91)
small_w = range(97,123)
num = range(48,58)
i = j = 0
while j<len(psd417):
    if psd417[j] in num:
        PSD417[i] = PSD417[i]-48
        if j==0 or (j>0 and psd417[j-1] not in num):
            PSD417[i:i] = [28]
            i += 1

    elif psd417[j] in big_w:
        PSD417[i] = PSD417[i]-65
        if j>0 : 
            if psd417[j-1]  in num:
                PSD417[i:i] = [28]
                i += 1
            if psd417[j-1] in small_w:
                PSD417[i:i] = [28,28]
                i += 2
    else:
        PSD417[i] = PSD417[i]-97       
        if j==0 or (j>0 and psd417[j-1]  not in small_w):
                PSD417[i:i] = [27]
                i += 1
    i += 1
    j += 1
# 将输入字符串进行补充，并计算码字
if len(PSD417)%2 == 1:
    PSD417.append(29) 
psd417_final = []
for i in range(0,len(PSD417),2):
    psd417_final.append(PSD417[i]*30+PSD417[i+1])

if s==-1:
    k=0
else:
    k = 2**(s+1)
# 若宽度不够，进行填充900
psd417_final_len =1+len(psd417_final)+k # 增加计算码和校验码
if psd417_final_len % w != 0:
    psd417_final.extend([900]*(w-psd417_final_len % w)) 
psd417_final[0:0] = [len(psd417_final)+1] 


# 加效验码
def add_poly(L1, L2):  # 多项式加法，同次项系数相加
    R = []
    if len(L1) > len(L2):  # 默认L2比较长
        L1, L2 = L2, L1
    i = 0
    while i < len(L1):
        R.append(L1[i] + L2[i])  # 从低次项开始对应相加
        i += 1
    R = R + L2[len(L1):len(L2)]  # 较长的多项式高次项直接复制
    return R


def subtract_poly(L1, L2):  # 多项式减法
    L2 = L2[:]  # 为了不改变传入的L2
    for i in range(len(L2)):
        L2[i] = -L2[i]
    return (add_poly(L1, L2))


def multiply_poly(L1, L2):  # 多项式乘法
    if len(L1) > len(L2):
        L1, L2 = L2, L1
    zero = []
    R = []
    for i in L1:
        T = zero[:]  # 存储中间产生的结果多项式，每次更新结果多项式的列表长度
        for j in L2:  # 一个单项式乘以多项式的每一项
            T.append(i * j)
        R = add_poly(R, T)
        zero = zero + [0]  # 每一个新的多形式都要比前一个多项式次数高1，列表长度增加，所以多补一个0
    return R


def divide_poly(L1, L2):
    if len(L1) < len(L2): 
        return 0, L1  # 商为0的情况

    d = len(L1) - len(L2)  # 循环除的次数为d+1
    T = L1[:]  # 被除数
    R = []  # 商
    for i in range(d+1):
        n = T[len(T) - 1] / L2[len(L2) - 1]  # 被除数的最高次项系数除以除数的最高次项的系数
        R = [n] + R
        T1 = [0] * (d - i) + [n]  # 对得到的商补若干个0
        T2 = multiply_poly(T1, L2)  # 商乘以除数结果为T2
        T = subtract_poly(T, T2)  # 被除数减去T2
        T = T[:len(T) - 1]  # 切片，被除数减少一次方
    return R, T
if k>0:
    # 求g(k)
    def g(k):
        L1 = [1]
        for i in range(1,k+1):
            G = [-3**i,1]
            L1 = multiply_poly(L1, G)
        return L1

    # 求d(x)
    def d(psd417_final):
        L = list(reversed(psd417_final))
        return L

    # 求r(x)
    d_x = d(psd417_final)
    g_x = g(k)
    # 扩大x**k
    L = [0]*k+d_x
    Business,yushu = divide_poly(L, g_x)
    q_x_g_x = multiply_poly(Business, g_x)
    r_x = subtract_poly(q_x_g_x, L)
    c = [] # 校验集合
    for i in r_x:
        if i !=0:
            c.append(int(i)%929)
    c.reverse()

    psd417_final = psd417_final + c


# 求 x**k*d(x)/g(x)的余数r(x)
for i in psd417_final:
    print(i)