codeforces-scrape

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

556B.md (2222B)


      1 Source: https://codeforces.com/problemset/problem/556/B
      2 
      3 B. Case of Fake Numbers
      4 
      5 time limit per test
      6 
      7 2 seconds
      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 Andrewid the Android is a galaxy-famous detective. He is now investigating a case of frauds who make fake copies of the famous Stolp's gears, puzzles that are as famous as the Rubik's cube once was.
     22 
     23 Its most important components are a button and a line of *n* similar gears. Each gear has *n* teeth containing all numbers from 0 to *n* - 1 in the counter-clockwise order. When you push a button, the first gear rotates clockwise, then the second gear rotates counter-clockwise, the the third gear rotates clockwise an so on.
     24 
     25 Besides, each gear has exactly one active tooth. When a gear turns, a new active tooth is the one following after the current active tooth according to the direction of the rotation. For example, if *n* = 5, and the active tooth is the one containing number 0, then clockwise rotation makes the tooth with number 1 active, or the counter-clockwise rotating makes the tooth number 4 active.
     26 
     27 Andrewid remembers that the real puzzle has the following property: you can push the button multiple times in such a way that in the end the numbers on the active teeth of the gears from first to last form sequence 0, 1, 2, ..., *n* - 1. Write a program that determines whether the given puzzle is real or fake.
     28 
     29 Input
     30 
     31 The first line contains integer *n* (1 ≤ *n* ≤ 1000) — the number of gears.
     32 
     33 The second line contains *n* digits *a*1, *a*2, ..., *a**n* (0 ≤ *a**i* ≤ *n* - 1) — the sequence of active teeth: the active tooth of the *i*-th gear contains number *a**i*.
     34 
     35 Output
     36 
     37 In a single line print "Yes" (without the quotes), if the given Stolp's gears puzzle is real, and "No" (without the quotes) otherwise.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 3  
     45 1 0 0
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 Yes
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 5  
     58 4 2 1 4 3
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 Yes
     65 ```
     66 
     67 Input
     68 
     69 ```
     70 4  
     71 0 2 3 1
     72 ```
     73 
     74 Output
     75 
     76 ```
     77 No
     78 ```
     79 
     80 Note
     81 
     82 In the first sample test when you push the button for the first time, the sequence of active teeth will be 2 2 1, when you push it for the second time, you get 0 1 2.