làm hộ e bằng python ạ

import sys
sys.stdin = open("tree.inp","r")
sys.stdout = open("tree.out","w")
n,k=map(int,input().split())
x=[0]+list(map(int,input().split()))
#￣へ￣ meothinhle
dmin=n; 
res=[]; 
a=[0]*(n+3)
for a[1] in range(1,1001):
    for i in range(2,n+1): a[i]=a[i-1]+k
    d=0; 
    for i in range(1,n+1):
        if x[i] < a[i]:
            d+=1
            a[i]=a[i]-x[i]
        elif x[i]>a[i]:
            d+=1
            a[i]=a[i]-x[i]
        else: a[i]=0
    if (d<dmin):
        dmin=d
        res=a.copy()
print(dmin)
for i in range(1,n+1):
    if (res[i]<0): print("-",i,abs(res[i]))
    elif res[i]>0: print("+",i,abs(res[i]))