UVa--1594 Ducci Sequence(模拟)

题解

#include <bits/stdc++.h>
using namespace std;

const int maxn = 15;
int   a[maxn];
int   n;

inline bool reachZero()
{
for(int i = 0; i < n; ++i)
if(a[i]) return false;
return true;
}

bool judge()
{
for(int i = 0; i < 1000; ++i)
{
if(reachZero())
return true;

int tmp = a[0];
for(int j = 0; j < n - 1; ++j)
{
a[j] = abs(a[j] - a[j + 1]);
}
a[n - 1] = abs(a[n - 1] - tmp);
}
return false;
}

int main()
{
int t;

cin >> t;
while(t--)
{
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i];

printf("%s\n", judge() ? "ZERO" : "LOOP");
}

return 0;
}