难得啊这次写的这么快,不过题简单是真的;
思路上借鉴了网上以为大神的解法,的确挺好的;
代码如下:
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int a[15], n;
bool is_zero() {
int mid = a[0], i;
for (i = 0; i < n; i++) {
if (i != n - 1)
a[i] = abs(a[i] - a[i + 1]);
else
a[i] = abs(a[i] - mid);
}
i = 0;
while (i++ < n) {
if (a[i] != 0)
return false;
}
return true;
}
int main() {
cin >> n;
int i = 0;
while (i++ < n) {
cin >> a[i];
}
int j = 0;
while (j++ < 1001) {
if (is_zero()) {
puts("ZERO");
break;
}
else {
puts("LOOP");
break;
}
}
return 0;
}