Submission #3591136


Source Code Expand

s = input()

def manyformulas(s):
    print('s:{0}'.format(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 0
Code Size 384 Byte
Status WA
Exec Time 18 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status AC
WA × 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 WA 18 ms 3060 KB
02.txt WA 18 ms 3060 KB
03.txt WA 18 ms 3060 KB
04.txt WA 17 ms 2940 KB
05.txt WA 17 ms 3060 KB
06.txt WA 17 ms 3060 KB
07.txt WA 18 ms 3060 KB
08.txt WA 18 ms 3060 KB
09.txt WA 17 ms 2940 KB
10.txt WA 17 ms 2940 KB
sample_01.txt WA 17 ms 2940 KB
sample_02.txt WA 18 ms 3060 KB