题目描述
Life is a game,and you lose it,so you suicide.
But you can not kill yourself before you solve this problem:
Given you a sequence of number a1, a2, ..., an.They are also a permutation of 1...n.
You need to answer some queries,each with the following format:
If we chose two number a,b (shouldn't be the same) from interval [l, r],what is the maximum gcd(a, b)? If there's no way to choose two distinct number(l=r) then the answer is zero.
题目大意：
给出一个序列，这个序列是1~n这n个数字的一个全排列。给出一个区间[L,R]，求区间内任意两个数的最大公约数的最大值。
输入
First line contains a number T(T <= 5),denote the number of test cases.
Then follow T test cases.
For each test cases,the first line contains a number n(1 <= n <= 50000).
The second line contains n number a1, a2, ..., an.
The third line contains a number Q(1 <= Q <= 50000) denoting the number of queries.
Then Q lines follows,each lines contains two integer l, r(1 <= l <= r <= n),denote a query.
译为：
第1行输入一个数T，表示T个测试。每个测试的第1行输入数字n（1≤n≤50000)。
第2行输入n个数，是1~n这n个数字的一个全排列。
第3行输入数字Q（1≤Q≤50000)，表示Q个查询。后面Q行中每行输入两个整数L和R，1≤L≤R≤n，表示一个查询。
输出
For each test cases,for each query print the answer in one line.
每个查询的结果打印一行。
1
10
8 2 4 9 5 7 10 6 1 3
5
2 10
2 4
6 9
1 4
7 10