努力搬砖的狒狒：第二题100% #include<bits/stdc++.h> using namespace std; //求最大公约数 int GCD(int a, int b) { int c = 0; while (c = a % b) { a = b; b = c; } return b; } int main(){ int n; cin >> n; vector<int> nums; while (n--) { int tmp; cin >> tmp; nums.push_back(tmp); } for (int num : nums) { int ans = 0; int n = sqrt(num); for (int i = 1; i <= n; i++) { int j = num / i; if (i * j / GCD(i, j) == num) ans++; } cout << ans << endl; } return 0; }