题目很简单,写博客就是留给自己看的,还是个大菜鸟,
#include<iostream>
#include<cstdio>
#include<list>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<cmath>
#include<memory.h>
#include<set>
#define ll long long
#define LL __int64
#define eps 1e-8
#define e 2.718281828
//const ll INF=9999999999999;
#define M 400000100
#define inf 0xfffffff
using namespace std;
//vector<pair<int,int> > G;
//typedef pair<int,int> P;
//vector<pair<int,int>> ::iterator iter;
//
//map<ll,int>mp;
//map<ll,int>::iterator p;
//
//vector<int>G[30012];
int num[1000012];
bool mark[100012];
int main(void)
{
int t;
cin>>t;
int n;
while(t--)
{
memset(num,0,sizeof(num));
cin>>n;
for(int i=1;i<=n;i++)
cin>>num[i];
bool flag;
int ans;
for(int i=1;;i++)
{
memset(mark,false,sizeof(mark));
flag=true;
for(int j=1;j<=n;j++)
{
if(mark[num[j]%i])
{
flag=false;
break;
}
mark[num[j]%i]=true;
}
if(flag)
{
ans=i;
break;
}
}
cout<<ans<<endl;
}
}