version 1(130ms):
#include<cstdio>
using namespace std;
const int maxn = 20;
int t,n,a[maxn];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
a[n] = 0;
int i;
for(i = 0;i < 1000;i++){
int mark = 0,t = a[0];
for(int j = 0;j < n;j++){
a[j] -= a[j+1];
if(a[j] < 0) a[j] = -a[j];
if(a[j]) mark = 1;
}
if(!mark) break;
a[n] = a[0];
}
printf("%s\n",i < 1000 ? "ZERO" : "LOOP");
}
return 0;
}
version 2(120ms):
#include<cstdio>
using namespace std;
const int maxn = 20;
int t,n,a[maxn];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
a[n] = 0;
int i;
for(i = 0;i < 1000;i++){
int mark = 0,t = a[0];
for(int j = 0;j < n;j++){
if(a[j] > a[j+1]) a[j] -= a[j+1]; //少了一次运算
else a[j] = a[j+1] - a[j];
if(a[j]) mark = 1;
}
if(!mark) break;
a[n] = a[0];
}
printf("%s\n",i < 1000 ? "ZERO" : "LOOP");
}
return 0;
}