CodeChef Gcd Queries

Gcd Queries   Problem code: GCDQ

Submit All Submissions

 

All submissions for this problem are available.

Read problems statements in Mandarin Chinese and Russian.

You are given an array A of integers of size N. You will be given Q queries where each query is represented by two integers L, R. You have to find the gcd(Greatest Common Divisor) of the array after excluding the part from range L to R inclusive (1 Based indexing). You are guaranteed that after excluding the part of the array
remaining array is non empty.

Input

• First line of input contains an integer T denoting number of test cases.
• For each test case, first line will contain two space separated integers N, Q.
• Next line contains N space separated integers denoting array A.
• For next Q lines, each line will contain a query denoted by two space separated integers L, R.

Output

For each query, print a single integer representing the answer of that query.

Constraints

Subtask #1: 40 points

• 2 ≤ T, N ≤ 100, 1 ≤ Q ≤ N, 1 ≤ A[i] ≤ 10⁵
• 1 ≤ L, R ≤ N and L ≤ R

Subtask #2: 60 points

• 2 ≤ T, N ≤ 10⁵, 1 ≤ Q ≤ N, 1 ≤ A[i] ≤ 10⁵
• 1 ≤ L, R ≤ N and L ≤ R
• Sum of N over all the test cases will be less than or equal to 10⁶.

Example

Input:
1
3 3
2 6 9
1 1
2 2
2 3

Output:
3
1
2

Explanation

For first query, the remaining part of array will be (6, 9), so answer is 3.
For second query, the remaining part of array will be (2, 9), so answer is 1.
For third query, the remaining part of array will be (2), so answer is 2.

Warning : Large IO(input output), please use faster method for IO.

求一个序列删去L~R后其余数的GCD ，，直接预处理一下前序GCD，后序GCD就OK~

#include <bits/stdc++.h>
using namespace std;
const int N = ;
int e[N],L[N],R[N],n,Q;
void Run() {
    scanf("%d%d",&n,&Q);
    for( int i =  ; i <= n ; ++i ) scanf("%d",&e[i]);
    L[] = e[]; for( int i =  ; i <= n ; ++i ) L[i] = __gcd( e[i] , L[i-] ) ;
    R[n] = e[n]; for( int i = n- ; i >=  ; --i ) R[i] = __gcd( e[i] , R[i+] ) ;
    while(Q--){
        int x , y ;
        scanf("%d%d",&x,&y);
        if( x >  ) {
            if( y < n )printf("%d\n",__gcd(L[x-],R[y+]));
            else printf("%d\n",L[x-]);
        }
        else {
            if( y < n )printf("%d\n",R[y+]);
            else puts("");
        }
    }
}
int main()
{
    int _ , cas =  ;
    scanf("%d",&_);
    while(_--)Run();
}