codeforces-scrape

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

158D.md (2090B)


      1 Source: https://codeforces.com/contest/158/problem/D
      2 
      3 D. Ice Sculptures
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 The Berland University is preparing to celebrate the 256-th anniversary of its founding! A specially appointed Vice Rector for the celebration prepares to decorate the campus. In the center of the campus *n* ice sculptures were erected. The sculptures are arranged in a circle at equal distances from each other, so they form a regular *n*-gon. They are numbered in clockwise order with numbers from 1 to *n*.
     22 
     23 The site of the University has already conducted a voting that estimated each sculpture's characteristic of *t**i* — the degree of the sculpture's attractiveness. The values of *t**i* can be positive, negative or zero.
     24 
     25 When the university rector came to evaluate the work, he said that this might be not the perfect arrangement. He suggested to melt some of the sculptures so that:
     26 
     27 * the remaining sculptures form a regular polygon (the number of vertices should be between 3 and *n*),
     28 * the sum of the *t**i* values of the remaining sculptures is maximized.
     29 
     30 Help the Vice Rector to analyze the criticism — find the maximum value of *t**i* sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved.
     31 
     32 Input
     33 
     34 The first input line contains an integer *n* (3 ≤ *n* ≤ 20000) — the initial number of sculptures. The second line contains a sequence of integers *t*1, *t*2, ..., *t**n*, *t**i* — the degree of the *i*-th sculpture's attractiveness ( - 1000 ≤ *t**i* ≤ 1000). The numbers on the line are separated by spaces.
     35 
     36 Output
     37 
     38 Print the required maximum sum of the sculptures' attractiveness.
     39 
     40 Examples
     41 
     42 Input
     43 
     44 ```
     45 8  
     46 1 2 -3 4 -5 5 2 3
     47 ```
     48 
     49 Output
     50 
     51 ```
     52 14
     53 ```
     54 
     55 Input
     56 
     57 ```
     58 6  
     59 1 -2 3 -4 5 -6
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 9
     66 ```
     67 
     68 Input
     69 
     70 ```
     71 6  
     72 1 2 3 4 5 6
     73 ```
     74 
     75 Output
     76 
     77 ```
     78 21
     79 ```
     80 
     81 Note
     82 
     83 In the first sample it is best to leave every second sculpture, that is, leave sculptures with attractivenesses: 2, 4, 5 и 3.