#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #include <complex> #include <unordered_map> #include <unordered_set> #include <random> #include <cassert> #include <fstream> #include <utility> #include <functional> #include <time.h> #include <stack> #include <array> #define popcount __builtin_popcount using namespace std; typedef long long int ll; typedef pair<int, int> P; ll calc(ll a, ll s, ll x, ll y){ if(a==0) return 0; if(a==1){ if(x==y) return s-1; else return 0; } if(x<=s) return 0; if((x-s)%(a-1)==0 && (x-s)/(a-1)<s) return 1; else return 0; } ll solve(ll x, ll y){ ll ans=0; for(ll i=1; i*i<=x+y; i++){ if((x+y)%i!=0) continue; ll z=(x+y)/i; if(i>1){ ans+=calc(i-1, z, x, y); } if(i*i<x+y){ ans+=calc(z-1, i, x, y); } } return ans; } int main() { int s; cin>>s; while(s--){ ll x, y; cin>>x>>y; cout<<solve(x, y)<<endl; } return 0; }