Submission #5032860
Source Code Expand
N = int(input()) S = [int(input()) for _ in range(N)] P = [sum(S[i:j]) for i in range(N) for j in range(i + 1, N + 1)] ans = max([P[i] for i in range(len(P)) if P[i] % 10 != 0], default=0) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | t_goto |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 205 Byte |
Status | WA |
Exec Time | 21 ms |
Memory | 3188 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 | 2940 KB |
a02 | AC | 17 ms | 2940 KB |
a03 | AC | 17 ms | 3060 KB |
b04 | AC | 17 ms | 2940 KB |
b05 | AC | 21 ms | 3188 KB |
b06 | AC | 18 ms | 3060 KB |
b07 | WA | 21 ms | 3188 KB |
b08 | WA | 21 ms | 3188 KB |
b09 | WA | 21 ms | 3188 KB |
b10 | AC | 17 ms | 2940 KB |
b11 | AC | 21 ms | 3188 KB |
b12 | AC | 21 ms | 3188 KB |