UVA11827 Maximum GCD

/*
 UVA11827 Maximum GCD 
 https://vjudge.net/contest/153365#problem/V
 数论 gcd
 水题，然而读入比较坑
 *
 */
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
//#define test
using namespace std;
const int Nmax=1005;

long long gcd(long long a,long long b)
{
    if(b==0LL)
        return a;
    return gcd(b,a%b);
}
long long num[Nmax];

int read(long long &a)
{
    long long ans=0LL;
    char c=getchar();
    while(c==' ')
        c=getchar();
    int flag=1;
    while(c>='0' && c<='9')
    {
        flag=0;
        ans=ans*10LL+c-'0';
        c=getchar();
    }
    if(flag)
    {
        a=1LL;
        return 0;
    }
    a=ans;
    if(c=='
')
    {
        //a=1LL;
        return 0;
    }
    return 1;
}

int main()
{
    #ifdef test
    freopen("uva.in","r",stdin);
    #endif
    int n;
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        long long mmax=-1LL;
        int m=0;
        while(read(num[++m]));
        //for(int i=1;i<=m;i++)
            //printf("%d ",num[i]);
        //printf("
");
        for(int i=1;i<=m;i++)
        {
            for(int j=i+1;j<=m;j++)
            {
                mmax=max(mmax,gcd(num[i],num[j]));
            }
        }
        printf("%lld
",mmax);
    }
    return 0;
}