using ll = long long;
ll gcd(ll a, ll b) {
while (b) {
ll t = b;
b = a % b;
a = t;
}
return a;
}
ll gcdsum() {
ll a, b;
std::cin >> a >> b;
ll g = gcd(a, b), ans = (g==1?1:2);
for (int i = 2; i*i <= g; i++) {
if (g % i == 0) {
if (g / i == i) {
ans++;
}
else {
ans += 2;
}
}
}
return ans;
}
如果i是公因数,那么g/i也是公因数