题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
const int maxn = 1e6 + 5, inf = 1e12, maxm = 4e4 + 5, base = 37;
const int N = 4e3;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;int n, m;
int a[maxn];//long long ? maxn ? n? m?
void solve(){ll res = 0;// cin >> n;int L, R;cin >> L >> R;res = 1;//设gcd为g，那么存在一个整数k，使得L <= (k - 1) * g < k * g <= R//因为k，g不会同时大于sqrt(R), 所以可以枚举k，g中较小的那个for(int i = 2; i * i <= R; i++){int j = R / i;if((i - 1) * j >= L) res = max(res, j);if((j - 1) * i >= L) res = max(res, i);}cout << res << '\n';
}signed main(){ios::sync_with_stdio(0);cin.tie(0);cout << fixed << setprecision(9);int T = 1;cin >> T;while (T--){solve();}return 0;
}