习题5_2 uva1594 Duccl序列

水题，比特别困的学生还没有思维量，小小模拟就好
直接上代码

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t,y[20];
	scanf("%d",&t);
	while (t--)
	{
		int n,f[20],ok = 1; //f储存现在 
		scanf("%d",&n);
		for (int i = 0; i < n; i++)
		  scanf("%d",&y[i]);
		for (int z = 0 ; z < 2000; z++)
		{
			int ky = 1;
			for (int i = 0; i < n; i++)
				f[i] = abs(y[i]-(y[(i+1)%n]));
			for (int i = 0; i < n; i++)
				y[i] = f[i];
			for (int i = 0; i < n; i++)
			{
				if(y[i])
				{
					ky = 0; break;
				}
			}
			if(ky)
			{
				ok = 0; break;
			}
		}
		if(ok)  printf("LOOP\n");
		else    printf("ZERO\n");
	}
	return 0;
}