Submission #3392573
Source Code Expand
n = int(input()) def digitsum(x): array = list(map(int, list(str(x)))) return sum(array) dsum = [digitsum(a)+digitsum(n-a) for a in range(1,int(n/2))] print(min(dsum))
Submission Info
Submission Time | |
---|---|
Task | A - Digits Sum |
User | Megane_88 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 182 Byte |
Status | RE |
Exec Time | 200 ms |
Memory | 3464 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
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 | 29 ms | 3060 KB |
in10.txt | AC | 34 ms | 3060 KB |
in2.txt | AC | 37 ms | 3060 KB |
in3.txt | AC | 116 ms | 3336 KB |
in4.txt | AC | 171 ms | 3464 KB |
in5.txt | AC | 17 ms | 2940 KB |
in6.txt | AC | 166 ms | 3452 KB |
in7.txt | AC | 17 ms | 3060 KB |
in8.txt | AC | 17 ms | 2940 KB |
in9.txt | RE | 17 ms | 2940 KB |
sample1.txt | AC | 17 ms | 2940 KB |
sample2.txt | AC | 200 ms | 3464 KB |