Codeforces Round #310 (Div. 2) B. Case of Fake Numbers

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

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.

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.

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.

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.

Input
The first line contains integer n (1 ≤ n ≤ 1000) — the number of gears.

The second line contains n digits a1, a2, …, an (0 ≤ ai ≤ n - 1) — the sequence of active teeth: the active tooth of the i-th gear contains number ai.

Output
In a single line print “Yes” (without the quotes), if the given Stolp’s gears puzzle is real, and “No” (without the quotes) otherwise.

Sample test(s)
input
3
1 0 0
output
Yes
input
5
4 2 1 4 3
output
Yes
input
4
0 2 3 1
output
No
Note
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.

这道题的意思是把转盘里的数字转动，知道数字从0开始一直顺序到n-1。转盘转动的规则是，如果转盘是奇数，就顺序加，如果是偶数，就逆序减，如果大于n，就是0，如果是小于0，就是n-1，因为数据不大，所以可以一边转动一边判断是否符合条件，也可以直接计算第一个转到0的次数直接转好再判断。

#include<iostream>
using namespace std;
int main()
{
    int n;
    int num[1010];
    int a[1010];
    while(cin>>n)
    {
        for(int i=1;i<=n;i++)
        {
            cin>>num[i];
            a[i]=num[i];
        }
        int flag=0;
        while(flag==0)
        {
            for(int i=1;i<=n;i++)     //是否为顺序 
            {
                flag=3;
                if(num[i]!=i-1)
                {
                    flag=0;
                    break;
                }
            }
            if(flag==3)  break;
            for(int i=1;i<=n;i++)
            {
                if(i%2==0)
                {
                    num[i]--;
                    if(num[i]<0)  num[i]=n-1;
                }
                else
                {
                    num[i]++;
                    if(num[i]>=n)  num[i]=0;
                }
            }
            for(int i=1;i<=n;i++)     //与 A 数组是否相同 
            {
                flag=2;
                if(num[i]!=a[i]) 
                {
                    flag=0;
                    break;
                } 
            }
            if(flag==2)  break;
        }
        if(flag==2)  cout<<"No"<<endl;
        if(flag==3)  cout<<"Yes"<<endl;
    }
    return 0;
}