codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

895A.md (2070B)


      1 Source: https://codeforces.com/problemset/problem/895/A
      2 
      3 A. Pizza Separation
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 Input
     24 
     25 The first line contains one integer *n* (1 ≤ *n* ≤ 360)  — the number of pieces into which the delivered pizza was cut.
     26 
     27 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.
     28 
     29 Output
     30 
     31 Print one integer  — the minimal difference between angles of sectors that will go to Vasya and Petya.
     32 
     33 Examples
     34 
     35 Input
     36 
     37 ```
     38 4  
     39 90 90 90 90
     40 ```
     41 
     42 Output
     43 
     44 ```
     45 0
     46 ```
     47 
     48 Input
     49 
     50 ```
     51 3  
     52 100 100 160
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 40
     59 ```
     60 
     61 Input
     62 
     63 ```
     64 1  
     65 360
     66 ```
     67 
     68 Output
     69 
     70 ```
     71 360
     72 ```
     73 
     74 Input
     75 
     76 ```
     77 4  
     78 170 30 150 10
     79 ```
     80 
     81 Output
     82 
     83 ```
     84 0
     85 ```
     86 
     87 Note
     88 
     89 In first sample Vasya can take 1 and 2 pieces, Petya can take 3 and 4 pieces. Then the answer is |(90 + 90) - (90 + 90)| = 0.
     90 
     91 In third sample there is only one piece of pizza that can be taken by only one from Vasya and Petya. So the answer is |360 - 0| = 360.
     92 
     93 In fourth sample Vasya can take 1 and 4 pieces, then Petya will take 2 and 3 pieces. So the answer is |(170 + 10) - (30 + 150)| = 0.
     94 
     95 Picture explaning fourth sample:
     96 
     97 ![](https://espresso.codeforces.com/7aeb1713868b7fb0ae534eafef943af97abd11ae.png)
     98 
     99 Both red and green sectors consist of two adjacent pieces of pizza. So Vasya can take green sector, then Petya will take red sector.