B. Case of Fake Numbers
time limit per test
memory limit per test
input
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.
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
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
0, 1, 2, …, n - 1. Write a program that determines whether the given puzzle is real or fake.
Input
n (1 ≤ n ≤ 1000) — the number of gears.
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
“Yes” (without the quotes), if the given Stolp’s gears puzzle is real, and “No”
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
2 2 1, when you push it for the second time, you get 0 1 2.
题意：有n个转盘，在位置上分别为1-n，每个转盘上在一圈分别写着0 — n-1，
现在有一个按钮，每一次按这个按钮，每个转盘都会发生一些变化，具体的变化是：
1.转盘在奇数位的，转盘上面的数字+1（也就是顺时针旋转）；
2.转盘在偶数位的，转盘上面的数字-1（也就是逆时针旋转）；
问能不能在摁下n次按钮后，使得第i个转盘上面的数字就是i-1。
思路：判断一下第一个转盘为0时，其他的转盘是不是满足第i个转盘的数字为i-1。不满足直接输出No。
点击打开链接
#include
#include
#include
#include
#include
#include
using namespace std;
int n;
int a[1005];
int main() {
while(scanf("%d",&n)!=EOF) {
for(int i=1; i 服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.e1idc.net
