这道题真的蛮水的,直接放代码了。
题目链接:UVa 1594
AC代码:
#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
const int maxn = 2000;
int num[maxn], n, num_c[maxn];
bool is_loop() {
for (int j=0;j<1000;j++) {
memcpy(num_c, num, sizeof(num));
int cnt = 0;
for (int i = 0; i < n; i++)
num[i] =abs( num_c[i] - num_c[(i + 1) % n]);
for (int i = 0; i < n; i++) {
if (num[i] == 0)
cnt++;
}
if (cnt == n)
return false;
}
return true;
}
int main() {
int T;
cin >> T;
while (T--) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> num[i];
if (is_loop())
cout << "LOOP" << endl;
else
cout << "ZERO" << endl;
}
return 0;
}