题库练习 Pizza Separation
← 上一题 下一题 →

A11401 | Pizza Separation

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into $n$ pieces. The $i$ -th piece is a sector of angle equal to $a_{i}$ . Vasya and Petya want to divide all pieces of pizza into two continuous sectors in such way that the difference between angles of these sectors is minimal. Sector angle is sum of angles of all pieces in it. Pay attention, that one of sectors can be empty.

输入格式

The first line contains one integer $n$ ( $1<=n<=360$ ) — the number of pieces into which the delivered pizza was cut.

The second line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=360$ ) — the angles of the sectors into which the pizza was cut. The sum of all $a_{i}$ is 360.

输出格式

Print one integer — the minimal difference between angles of sectors that will go to Vasya and Petya.

输入输出样例

输入 #1
4
90 90 90 90
输出 #1
0
输入 #2
3
100 100 160
输出 #2
40
输入 #3
1
360
输出 #3
360
输入 #4
4
170 30 150 10
输出 #4
0
C++ 编辑器
输入
输出