pub mod binary_search { type T = usize; pub fn binary_search(mut ok: T, mut ng: T, f: impl Fn(T) -> bool) -> T { let cont = |ok: T, ng: T| { let l = ok.min(ng); let r = ok.max(ng); l + 1 < r }; while cont(ok, ng) { let x = (ok + ng) / 2; if f(x) { ok = x; } else { ng = x; } } ok } } pub mod scanner { pub struct Scanner { buf: Vec, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec { source .split_whitespace() .rev() .map(String::from) .collect::>() } } } use crate::{binary_search::binary_search, scanner::Scanner}; use std::io::Write; fn main() { let mut scanner = Scanner::new(); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); let t: usize = scanner.next(); for _ in 0..t { solve(&mut scanner, &mut out); } } fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter) { let a: usize = scanner.next(); let b: usize = scanner.next(); let xx = binary_search(1e18 as usize, a + b, |xx| { a * b * 4 < (xx - a - b) * (xx - a - b) }); let x = binary_search(xx, 0, |x| xx <= x * x); writeln!(out, "{}", x).unwrap(); }