#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<string>
#include<cassert>
#include<cctype>
#include<memory.h>
#include<cstdio>
#include<sstream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cstdlib>
using namespace std;
int digit[20];
bool Ducci(int n)
{
int temp = digit[0];
for (int i = 0; i < n - 1; i++)
digit[i] = (int)abs(digit[i] - digit[i + 1]);
digit[n - 1] = (int)abs(digit[n - 1] - temp);
for (int i = 0; i < n;i++)
if(digit[i])return false;
return true;
}
int main()
{
int T = 0;
cin >> T;
while (T--)
{
memset(digit, 0, sizeof(digit));
int N = 0;
cin >> N;
for (int i = 0; i < N; i++)
cin >> digit[i];
int n = 1000;
while (n--)
{
if (Ducci(N))
{
cout << "ZERO" << endl;
break;
}
}
if (n==-1)
cout << "LOOP" << endl;
}
return 0;
}
UVA-1594 Ducci Sequence
最新推荐文章于 2024-04-09 16:18:18 发布