[파이썬] 3518 공백왕 빈-칸

li, m = [], []
i = 0

while True:
    try:
        line = input().split()
        li.append(line)
        for i, l in enumerate(line):
            if i < len(m):
                m[i] = max(m[i], len(l))
            else:
                m.append(len(l))
    except:
        break

for i, l in enumerate(li):
    for j, w in enumerate(l):
        li[i][j] = w + (m[j] - len(w)) * ' '

for l in li:
    print(' '.join(l).rstrip())