题解 | #约数的个数#

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int mod = 1e9 + 7;

int main() {
    int n;
    while (cin >> n) {
        while (n--) {
            unordered_map<int, int> primes;
            int x;
            cin >> x;
            for (int i = 2; i <= x / i; i++) {
                while (x % i == 0) {
                    x /= i;
                    primes[i] ++ ;
                }
            }
            if (x > 1) {
                primes[x] ++;
            }
            LL res = 1;

            for (auto item : primes) {
                res *= (item.second + 1);
            }

            cout << res << endl;
        }
    }
    return 0;
}