Submission #5031356
Source Code Expand
n = int(input()) ''' data = [] for i in range(10): data.append([]) for i in range(n): d = int(input()) data[d%10].append(d) for i in range(10): data[i].sort() res = sum(data[0]) for i in range(1,5): while data[i]!=[] and data[10-i]!=[]: res+=data[i].pop()+data[10-i]+pop() ''' res = 0 m = 101 for i in range(n): d = int(input()) res+=d if d%10!=0 and d<m: m = d if res%10==0: if m<100: res = res-m else: res = 0 print(res)
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | Ruloch |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 535 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 17 ms | 3060 KB |
a02 | AC | 17 ms | 2940 KB |
a03 | AC | 17 ms | 2940 KB |
b04 | AC | 17 ms | 3060 KB |
b05 | AC | 17 ms | 2940 KB |
b06 | AC | 17 ms | 2940 KB |
b07 | AC | 17 ms | 3060 KB |
b08 | AC | 17 ms | 2936 KB |
b09 | AC | 17 ms | 2940 KB |
b10 | AC | 17 ms | 2940 KB |
b11 | AC | 17 ms | 3060 KB |
b12 | AC | 17 ms | 2940 KB |