uva11827 处理下输入

/*0.012s*/

#include<cstdio>
#include<algorithm>
using namespace std;

int num[], n;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

int cal()
{
    int i, j, maxn = ;
    for (i = ; i < n - ; ++i)
        for (j = i + ; j < n; ++j)
            maxn = max(maxn, gcd(num[i], num[j]));
    return maxn;
}

int main()
{
    int t;
    char ch;
    scanf("%d\n", &t);
    while (t--)
    {
        n = ;
        while (true)
        {
            scanf("%d", &num[n++]);
            while ((ch = getchar()) == ' ')
                ;
        //    ungetc(ch, stdin);
            if (ch ==  || ch == -) break;
        }
        printf("%d\n", cal());
    }
    return ;
}