CodeForces 75 C.Modified GCD

Well, here is another math class task. In mathematics, GCD is the greatest common divisor, and it’s an easy task to calculate the GCD between two positive integers.

A common divisor for two positive numbers is a number which both numbers are divisible by.

But your teacher wants to give you a harder task, in this task you have to find the greatest common divisor d between two integers a and b that is in a given range from low to high (inclusive), i.e. low ≤ d ≤ high. It is possible that there is no common divisor in the given range.

You will be given the two integers a and b, then n queries. Each query is a range from low to high and you have to answer each query.

Input
The first line contains two integers a and b, the two integers as described above (1 ≤ a, b ≤ 109). The second line contains one integer n, the number of queries (1 ≤ n ≤ 104). Then n lines follow, each line contains one query consisting of two integers, low and high (1 ≤ low ≤ high ≤ 109).

Output
Print n lines. The i-th of them should contain the result of the i-th query in the input. If there is no common divisor in the given range for any query, you should print -1 as a result for this query.

Examples
Input
9 27
3
1 5
10 11
9 11
Output
3
-1
9

题意：给你两个数和一个区间让你求这两个数在这个区间上的最大公约数

思路：求出两个数的最大公约数，并预处理取出他们的因子，寻找符合区间的最大的因子（注意去掉不存在的情况）

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
ll c[100010];
ll gcd(ll a,ll b)
{
    if(b==0)return a;
    else
        return gcd(b,a%b);
}

int main()
{
    ll a,b,n,d,k=0;
    scanf("%lld%lld%lld",&a,&b,&n);
    d=gcd(a,b);
    for(int i=1;i*i<=d;i++)
    {
        if(d%i==0)
        {
            c[k++]=i;
            if(i*i!=d)c[k++]=d/i;
        }
    }
    sort(c,c+k);

    while(n--)
    {
        ll l,h;
         scanf("%lld%lld",&l,&h);
         if(l>d)//区间始终比最大公约数大
         {
             printf("-1\n");
             continue;
         }
         ll ans;
         ans=upper_bound(c,c+k,h)-c-1;
         if(ans==-1||c[ans]<l)//没找到或c[ans]<l并且c[ans+1]>h
        {
             printf("-1\n");
             continue;
         }
         printf("%lld\n",c[ans]);

    }
}