2293.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 34 行

/*  This Code is Submitted by wywcgs for Problem 2293 on 2006-07-25 at 20:41:09 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int S = 1 << 20;
const int N = 512;

int mod[S];

int main()
{
	int t, T, i, j;
	int id[N], g;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		scanf("%d", &g);
		for(i = 0; i < g; i++) scanf("%d", &id[i]);
		memset(mod, -1, sizeof(mod));
		for(i = g; true; i++) {
			for(j = 0; j < g; j++) {
				int k = id[j] % i;
				if(mod[k] == i) break;
				else mod[k] = i;
			}
			if(j == g) break;
		}
		printf("%d\n", i);
	}
	
	return 0;
}