import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const numCases = readInt(); foreach (caseId; 0 .. numCases) { long X = readLong(); long Y = readLong(); if (X > Y) { swap(X, Y); } long ans; if (X == Y) { /* B = C X = (A + 1) B */ void check0(long d) { if (d > 1) { debug { writeln([d - 1, X / d, X / d]); } ++ans; } } for (long d = 1; d^^2 <= X; ++d) { if (X % d == 0) { check0(d); if (d != X / d) { check0(X / d); } } } /* A = 1, B != C */ ans += (X - 1) / 2 * 2; } else { /* Y - X = (A - 1) (C - B) [ A 1 ] [ B ] = [ X ] [ 1 A ] [ C ] [ Y ] */ void check(long d) { const a = d + 1; const denom = a^^2 - 1; const numerB = a * X - Y; const numerC = a * Y - X; if (numerB > 0 && numerC > 0 && numerB % denom == 0 && numerC % denom == 0) { debug { writeln([a, numerB / denom, numerC / denom]); } ++ans; } } for (long d = 1; d^^2 <= Y - X; ++d) { if ((Y - X) % d == 0) { check(d); if (d != (Y - X) / d) { check((Y - X) / d); } } } } writeln(ans); } } } catch (EOFException e) { } }