#include using namespace std; //#pragma GCC target("arch=skylake-avx512") #pragma region template // Define using ll = long long; using ull = unsigned long long; using ld = long double; template using pvector = vector>; template using rpriority_queue = priority_queue, greater>; constexpr const ll dx[4] = {1, 0, -1, 0}; constexpr const ll dy[4] = {0, 1, 0, -1}; constexpr const ll MOD = 1e9 + 7; constexpr const ll mod = 998244353; constexpr const ll INF = 1LL << 60; constexpr const ll inf = 1 << 30; constexpr const char rt = '\n'; constexpr const char sp = ' '; #define rt(i, n) (i == (ll)(n) -1 ? rt : sp) #define len(x) ((ll)(x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define ifn(x) if (not(x)) #define elif else if #define elifn else ifn #define fi first #define se second #define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end())) #define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin())) using graph = vector>; template using wgraph = vector>>; bool __DIRECTED__ = true; bool __ZERO_INDEXED__ = false; istream &operator>>(istream &is, graph &g) { ll a, b; is >> a >> b; if (__ZERO_INDEXED__ == false) a--, b--; g[a].pb(b); if (__DIRECTED__ == false) g[b].pb(a); return is; } template istream &operator>>(istream &is, wgraph &g) { ll a, b; T c; is >> a >> b >> c; if (__ZERO_INDEXED__ == false) a--, b--; g[a].pb({b, c}); if (__DIRECTED__ == false) g[b].pb({a, c}); return is; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } // Debug #define debug(...) \ { \ cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \ for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \ cerr << rt; \ } #define dump(a, h, w) \ { \ cerr << __LINE__ << ": " << #a << " = [" << rt; \ rep(__i, h) { \ rep(__j, w) { \ if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \ if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp; \ else \ cerr << a[__i][__j] << sp; \ } \ cerr << rt; \ } \ cerr << "]" << rt; \ } #define vdump(a, n) \ { \ cerr << __LINE__ << ": " << #a << " = ["; \ rep(__i, n) { \ if (__i) cerr << sp; \ if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \ if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp; \ else \ cerr << a[__i]; \ } \ cerr << "]" << rt; \ } // Loop #define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i) #define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i) #define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i) #define each(i, a) for (auto &&i : a) // Stream #define fout(n) cout << fixed << setprecision(n) struct io { io() { cin.tie(nullptr), ios::sync_with_stdio(false); } } io; // Speed #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma GCC optimize("Ofast,unroll-loops") // Math inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; } inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; } inline constexpr ll modulo(const ll n, const ll m = MOD) { ll k = n % m; return k + m * (k < 0); } inline constexpr ll chmod(ll &n, const ll m = MOD) { n %= m; return n += m * (n < 0); } inline constexpr ll mpow(ll a, ll n, const ll m = MOD) { ll r = 1; rep(i, 64) { if (n & (1LL << i)) r *= a; chmod(r, m); a *= a; chmod(a, m); } return r; } inline ll inv(const ll n, const ll m = MOD) { ll a = n, b = m, x = 1, y = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); x -= t * y; swap(x, y); } return modulo(x, m); } #pragma endregion struct Rational { using Int = long long; using Double = long double; Int n, d; Rational(Int x = 0, Int y = 1) : n(x), d(y) { Int g = gcd(abs(n), abs(d)); if (d < 0) g *= -1; n /= g, d /= g; // if (d == 0) n = 1; // inf と -inf を同一視したくない場合は消す } Rational operator-() const { return Rational(-n, d); } Rational &operator+=(const Rational &a) { return *this = Rational(n * a.d + d * a.n, d * a.d); } Rational &operator-=(const Rational &a) { return *this = Rational(n * a.d - d * a.n, d * a.d); } Rational &operator*=(const Rational &a) { return *this = Rational(n * a.n, d * a.d); } Rational &operator/=(const Rational &a) { return *this = Rational(n * a.d, d * a.n); } Rational operator+(const Rational &a) const { return Rational(*this) += a; } Rational operator-(const Rational &a) const { return Rational(*this) -= a; } Rational operator*(const Rational &a) const { return Rational(*this) *= a; } Rational operator/(const Rational &a) const { return Rational(*this) /= a; } bool operator==(const Rational &a) const { return n == a.n and d == a.d; } bool operator!=(const Rational &a) const { return n != a.n or d != a.d; } bool operator<=(const Rational &a) const { return n * a.d <= d * a.n; } bool operator<(const Rational &a) const { return n * a.d < d * a.n; } friend Int rtoi(const Rational &a) { return a.n / a.d; } friend Double rtod(const Rational &a) { return Double(a.n) / Double(a.d); } friend istream &operator>>(istream &is, Rational &a) { string x; is >> x; Int y = 1; auto iter = find(x.begin(), x.end(), '.'); if (iter != x.end()) { Int dig = x.end() - iter - 1; for (Int i = 0; i < dig; i++) y *= 10; x.erase(iter); } a = Rational(stol(x), y); return is; } friend ostream &operator<<(ostream &os, const Rational &a) { os << a.n << '/' << a.d; return os; } }; signed main() { ll T; cin >> T; rep(i, T) { ll X, Y, N; cin >> X >> Y; N = X + Y; vector A; ll res = 0; for (int i = 1; i * i <= N; i++) { if (N % i == 0) { if (i * i == N) { if (i != 1 and i != 2) { ll a = i - 1, c = (a * Y - X) / (a * a - 1), b = (X - c) / a; if (a * b + c == X and a * c + b == Y and b > 0 and c > 0) res++; } } else { if (i != 1 and i != 2) { ll a = i - 1, c = (a * Y - X) / (a * a - 1), b = (X - c) / a; if (a * b + c == X and a * c + b == Y and b > 0 and c > 0) res++; } if (N / i != 1 and N / i != 2) { ll a = N / i - 1, c = (a * Y - X) / (a * a - 1), b = (X - c) / a; if (a * b + c == X and a * c + b == Y and b > 0 and c > 0) res++; } } } } cout << res << rt; } }