Submission #2607298

Source Code Expand

n = int(raw_input())
a = 1
best = 999999999999999
def score(a, b):
    return sum([int(c) for c in str(a) + str(b)])
while a <= n/2:
    b = n - a
    best = min(best, score(a, b))
    a += 1
print best

Submission Info

Submission Time
Task A - Digits Sum
User naoya_t
Language Python (2.7.6)
Score 200
Code Size 213 Byte
Status AC
Exec Time 250 ms
Memory 2568 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 25 ms 2568 KB
in10.txt AC 30 ms 2568 KB
in2.txt AC 34 ms 2568 KB
in3.txt AC 130 ms 2568 KB
in4.txt AC 206 ms 2568 KB
in5.txt AC 10 ms 2568 KB
in6.txt AC 202 ms 2568 KB
in7.txt AC 10 ms 2568 KB
in8.txt AC 10 ms 2568 KB
in9.txt AC 10 ms 2568 KB
sample1.txt AC 10 ms 2568 KB
sample2.txt AC 250 ms 2568 KB