No Pain No Game

 http://acm.hdu.edu.cn/showproblem.php?pid=4630

思路：每次添加a[i];记录a[i]分因子位置；如果因子k出现过，那么当前位置到因子k上一次的位置最大两个gcd最少为k；维护线段树区间最大因子；同时离线处理右区间是当前位置的询问

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------


const int maxn=5e4+9;
const int mod=1e9+7;

struct node
{
    int gd;
}tree[maxn*4];
int a[maxn];
int pre[maxn];
void pushup(int rt)
{
    tree[rt].gd=max(tree[rt<<1].gd,tree[rt<<1|1].gd);
}

void build(int rt,int l,int r)
{
    tree[rt].gd=0;
    if(l==r)
    {
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}
void update(int rt,int l,int r,int pos,int val)
{
    if(l==r)
    {
        tree[rt].gd=max(val,tree[rt].gd);
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid) update(rt<<1,l,mid,pos,val);
    else update(rt<<1|1,mid+1,r,pos,val);
    pushup(rt);
}
int query_gcd(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].gd;
    }
    int mid=(l+r)>>1;
    if(qr<=mid)return query_gcd(rt<<1,l,mid,ql,qr);
    if(ql>mid) return query_gcd(rt<<1|1,mid+1,r,ql,qr);
    else
    {
        return max(query_gcd(rt<<1,l,mid,ql,mid),query_gcd(rt<<1|1,mid+1,r,mid+1,qr));
    }

}

struct Q
{
    int id,l,r,ans;
    Q(){}
    Q(int _id,int _l,int _r){id=_id,l=_l,r=_r;}
}q[maxn];
bool cmp1(Q x,Q y)
{
    return x.r<y.r;
}
bool cmp2(Q x,Q y)
{
    return x.id<y.id;
}
void init()
{
    mem(pre,0);
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    T=read();
    while(T--)
    {
        init();
        int n;
        n=read();
        for(int i=1;i<=n;i++)
        {
            a[i]=read();
        }
        build(1,1,n);
        int m=read();
        for(int i=1;i<=m;i++)
        {
            int l,r;
            l=read();
            r=read();
            q[i]=Q(i,l,r);
        }
        sort(q+1,q+m+1,cmp1);
        int now=1;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j*j<=a[i];j++)
            {
                if(a[i]%j==0)
                {
                    if(pre[j])
                        update(1,1,n,pre[j],j);
                    if(j*j!=a[i]&&pre[a[i]/j])
                    {
                        update(1,1,n,pre[a[i]/j],a[i]/j);
                    }
                    pre[j]=pre[a[i]/j]=i;
                }
            }
            //fl();
            while(now<=m&&q[now].r==i)
            {
                if(q[now].l>=q[now].r)
                    q[now].ans=0;
                else q[now].ans=query_gcd(1,1,n,q[now].l,q[now].r);
                now++;
            }
        }
        sort(q+1,q+1+m,cmp2);
        for(int i=1;i<=m;i++) pri(q[i].ans);
    }

    return 0;
}