E - Modified GCD CodeForces - 75C

水题

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 100010;
int gcd (int a,int b){
    return b==0?a:gcd (b,a%b);
}
int fac[maxn];
int main (){
    int a,b;
    scanf ("%d%d",&a,&b);
    int n;
    scanf ("%d",&n);
    int c = gcd (a,b);
    int i;
    int cnt = 0;
    for (i=1;i*i <=c;i++){
        if (c%i==0){
            if (i*i!=c){
                fac[++cnt] = i;
                fac[++cnt] = c/i;
            }
            else fac[++cnt] = i;
        }
    }
    sort (fac+1,fac+1+cnt);
    for (i=1;i<=n;i++){
        scanf ("%d%d",&a,&b);
        int ans;
        int l = 0,r = cnt+1;
        while (r-l>1){
            int mid = (r+l)/2;
            if (fac[mid] <=r){
                l = mid;
            }
            else r = mid;
        }
        if (fac[r]<=b) ans = fac[r];
        else ans = fac[l];
        if (ans>=a) printf("%d\n", ans);
        else printf("-1\n");
    }
    return 0;
}