UVA - 11827 Maximum GCD（输入技巧+GCD暴力）

Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible
pair of these integers.
Input
The first line of input is an integer N (1 < N < 100) that determines the number of test cases.
The following N lines are the N test cases. Each test case contains M (1 < M < 100) positive
integers that you have to find the maximum of GCD.
Output
For each test case show the maximum GCD of every possible pair.
Sample Input
3
10 20 30 40
7 5 12
125 15 25
Sample Output
20
1
25

只有输入的地方有坑，因为数据很小，直接暴力求gcd。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;

#define lowbit(a) (a&(-a))
#define ll long long
const int inf=