#include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <utility> #include <string> #include <queue> #include <stack> #include <unordered_map> using namespace std; typedef long long int ll; typedef pair<int, int> Pii; const ll mod = 998244353; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vector<pair<ll, ll>> ab(n); for (auto &x: ab) cin >> x.first >> x.second; vector<ll> ans; for (int i = 0; i < n; i++) { __int128_t a = ab[i].first; __int128_t b = ab[i].second; __int128_t ng = 0; __int128_t ok = 100000; while (abs((ll) (ng - ok)) > 1) { __int128_t mid = (ng + ok) / 2; __int128_t x2ab = (mid * mid - a - b); __int128_t x2ab2 = x2ab * x2ab; if (x2ab >= 0 && a * b * 4 < x2ab2) ok = mid; else ng = mid; } ans.push_back(ok); } for (auto &x: ans) cout << x << endl; return 0; }