2011百度之星B第一题

#include <stdio.h>#include <stdlib.h>#define NUM 1000intresolve (int arr[], int n, int len){ int i, j, k; for (i = 0; i < n; ++i) { if (arr[i] != (i + 1)) { for (j = i + len; j != i; j = (j + len) % n) { if (arr[j] == (i + 1)) break; } if (j == i) return 0; } } return 1;}intmain (int argc, char **argv){ int n, a, b, i, k; int *arr; int result[NUM]; scanf ("%d", &n); k = 0; while (n > 0) { arr = (int *) malloc (sizeof (int) * n); scanf ("%d%d", &a, &b); for (i = 0; i < n; ++i) scanf ("%d", arr + i); result[k++] = resolve (arr, n, (a > b) ? (a - b) : (b - a)); free (arr); scanf ("%d", &n); } for (i = 0; i < k; ++i) { if (result[i]) printf ("Yes/n"); else printf ("No/n"); } return 0;}