【暴力模拟】UVA 1594 - Ducci Sequence

想麻烦了。这题真的那么水啊。。直接暴力模拟，1000次（看了网上的200次就能A）后判断是否全为0，否则就是LOOP；

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <map>
#include <stack>
#include <list>
#include <iomanip>

using namespace std;
#define INF 0x7fffffff
#define eps 1e-5
const int maxn = 20;
const int maxl = 1010;
int a[maxn], vis[maxn];
int n;
bool Judge(int k)
{
bool zero = false;
for(int i = 1; i <= n; i++)
{
if(a[i] && a[i] != k)
return 0;
if(!a[i])   zero = true;
//        printf("%d ", a[i]);
}
if(zero)    return 1;
else return 0;
}

int main()
{
int T;
scanf("%d", &T);
while(T--)
{
memset(vis, 0, sizeof(vis));
memset(a, 0, sizeof(a));
int cnt = 0;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
a[n+1] = a[1];
int cur = 1, zero = 0;
while(cur <= 200)
{
//            cout << "----" <<endl;

for(int i = 1; i <= n; i++)
{
a[i] = abs(a[i]-a[i+1]);
}
a[n+1] = a[1];
//cout << num << endl;
zero = 0;
for(int i = 1; i <= n; i++)
if(!a[i])
zero++;

//            cout << num << endl;
if(zero == n)
{
printf("ZERO\n");
zero = -1;
break;
}
cur++;
}

if(zero != -1)     printf("LOOP\n");
}
return 0;
}