Submission #3808784
Source Code Expand
n=int(input()) a=list(map(int,input().split())) x=sum(a) y=0 l=[] for i in range(n-1): y+=a[i] l.append(abs(x-2*y)) print(min(l))
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | akariki |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 141 Byte |
Status | AC |
Exec Time | 161 ms |
Memory | 24832 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 17 ms | 3060 KB |
00_example_02.txt | AC | 17 ms | 2940 KB |
01.txt | AC | 85 ms | 13936 KB |
02.txt | AC | 43 ms | 6720 KB |
03.txt | AC | 37 ms | 5820 KB |
04.txt | AC | 108 ms | 16188 KB |
05.txt | AC | 37 ms | 5832 KB |
06.txt | AC | 161 ms | 24832 KB |
07.txt | AC | 153 ms | 23776 KB |
08.txt | AC | 153 ms | 24812 KB |
09.txt | AC | 156 ms | 23776 KB |
10.txt | AC | 159 ms | 23792 KB |
11.txt | AC | 17 ms | 3060 KB |
12.txt | AC | 19 ms | 3188 KB |
13.txt | AC | 146 ms | 20988 KB |
14.txt | AC | 18 ms | 3060 KB |