Ducci 队列 -基础queue，set

https://vjudge.net/contest/185301#problem/B

用队列记录，set的不重复性来判断

 //#include<bits/stdc++.h>
 #include<stdio.h>
 #include<string.h>
 #include<math.h>
 #include<iostream>
 #include<stdlib.h>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<string>
 #include<set>
 #include<cctype>
 #include<sstream>
 #define mem(a) memset(a,0,sizeof(a))
 #define LL long long
 #define ull unsigned long long
 #define inf 0x3f3f3f3f
 using namespace std;
 const int N=;
 int n,k;
 char s[],ss[];
 int a[],b[];
 LL f[][][];
 int abs(int a)
 {
   if(a<) return -a;
   return a;
 }
 int main()
 {
     int t,v,c;
  scanf("%d",&t);
  while(t--)
  {
      scanf("%d",&n);
      queue<int>q;
      set<int>s;
      int flag=;
      for(int i=;i<=n;i++)
      {
          scanf("%d",&v);
          q.push(v);
      }
      for(int i=;i<;i++)
      {
        for(int j=;j<=n;j++)
         {
          if(j==)
          {
           int u=q.front();
           int k=q.back();
           c=abs(u-k);
          }
          int u=q.front();
          q.pop();
          if(j<n)
          {
             int k=q.front();
             q.push(abs(u-k));
             s.insert(abs(u-k));
          }
          if(j==n)
          {
              q.push(c);
              s.insert(c);
          }
         }
         if(s.size()==)
         {
             flag=;
             break;
         }
          s.clear();//!!
      }
      while(!q.empty())
      {
         q.pop(); //!!
      }
      if(flag==) printf("ZERO\n");
      else printf("LOOP\n");
  }
  return ;
 }