Submission #2379022

---

Source Code Expand

def return_binary(n, s):
    t = bin(n)[2:]
    while s > len(t):
        t = '0' + t
    t = t + '1'
    return t


def add_up(n, b):
    temp = ''
    total = 0
    for x in range(len(n)):
        temp = temp + n[x]
        if b[x] == '1':
            total = total + int(temp)
            temp = ''
    return total


raw_input = input()
length = len(raw_input)
tot = 0

if length == 1:
    print(raw_input)
else:
    for i in range(2**(length-1)):
        binary = return_binary(i, length-1)
        tot = tot + add_up(raw_input, binary)
    print(tot)

Submission Info

Judge Result