Submission #3591147


Source Code Expand

s = input()

def manyformulas(s):
    if len(s)==1:
        return 1,int(s[0])
    else:
        sum = int(s)
        count = 1
        for i in range(len(s)-1):
            c, recursive = manyformulas(s[(i+1):])
            sum += c*int(s[:(i+1)]) + recursive
            count += c

        return count, sum

print(manyformulas(s)[1])

Submission Info

Submission Time
Task C - Many Formulas
User Gaozou97
Language Python (3.4.3)
Score 300
Code Size 354 Byte
Status AC
Exec Time 18 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status AC
AC × 12
Set Name Test Cases
Sample
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt AC 18 ms 2940 KB
02.txt AC 18 ms 3060 KB
03.txt AC 18 ms 2940 KB
04.txt AC 17 ms 2940 KB
05.txt AC 17 ms 2940 KB
06.txt AC 17 ms 2940 KB
07.txt AC 18 ms 2940 KB
08.txt AC 18 ms 2940 KB
09.txt AC 17 ms 2940 KB
10.txt AC 17 ms 2940 KB
sample_01.txt AC 17 ms 2940 KB
sample_02.txt AC 18 ms 2940 KB