Submission #2859303
Source Code Expand
N = int(input()) s = [int(input()) for x in range(N)] fullmax = sum(s) s_sorted = sorted(s) cur_max = 0 if fullmax % 10 != 0 : print(fullmax) else : # if everything divisable by zero div_flg = True for i in s : if i % 10 != 0 : div_flg = False if div_flg == True : print("0") else : for i in range(N - 1) : if fullmax - s[i] % 10 != 0 : cur_max = max(fullmax - s[i], cur_max) print(cur_max)
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | pupupupupunta |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 537 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 3064 KB |
a03 | AC | 17 ms | 3060 KB |
b04 | AC | 17 ms | 3064 KB |
b05 | AC | 17 ms | 3060 KB |
b06 | AC | 17 ms | 3060 KB |
b07 | WA | 17 ms | 2940 KB |
b08 | AC | 17 ms | 3060 KB |
b09 | WA | 17 ms | 2940 KB |
b10 | AC | 17 ms | 3064 KB |
b11 | AC | 17 ms | 3064 KB |
b12 | AC | 17 ms | 3060 KB |