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
题意:给你两个数,再给你一个范围,问是否在这个范围里存在这两个数的公约数。
思路:先用求出这两个数的最大公约数,然后求这个最大公约数的约数,再看范围内是否存在。
这里有一个快速求所有公约数的方法:
先求出 GCD(a , b ) = g;
然后找g的约数,同时g除以g的约数也是g的约数,最后排序(从1到sqrt(g)枚举,用数学归纳法可以证明)。
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=100010;
typedef long long ll;
int s[maxn];
int gcd(int a,int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
ios::sync_with_stdio(false);
int a,b;
int n,l,h;
while(cin>>a>>b)
{
int g=gcd(a,b);
int cnt=0;
for(int i=1;i<=sqrt(g+0.5);i++)
{
if(g%i==0)
{
s[cnt++]=i;
s[cnt++]=g/i;
}
}
sort(s,s+cnt);
cin>>n;
while(n--)
{
bool flag=false;
int maxn=0;
cin>>l>>h;
for(int i=0;i<cnt;i++)
{
if(s[i]>=l&&s[i]<=h)
{
flag=true;
maxn=max(maxn,s[i]);
}
}
if(flag)
cout<<maxn<<endl;
else
cout<<"-1"<<endl;
}
}
return 0;
}