十进制转二进制 正整数 python 凑数法

a = int(input())
sb = []
i = -1
sum1 = 1
mav = [1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384]
for j in mav:

    if a>j or a==j:
        i = i + 1
        sb.append("0")
    elif a<j:
        break
while(a!=0):
    n = -1
    for k in mav[0:i+1]:

        if a==k:
            n = n + 1
            sb[n]="1"
        elif a>k:
            n = n + 1
            continue
        elif a<k:
            sb[n]="1"
    a=a-mav[n]

sb[-1]="1"
sb.reverse()
for l in sb:
    print(l,end="")

小菜鸟一枚