题解 | #小苯的数字权值#

#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 3e5 + 10;
const int M = 1e3 + 10;
int mod = 1e9 + 7;
int a[N];

void solve() {
    int x;
    cin >> x;
    int maxx = 0, sum = 1;
    for (int i = 2; i * i <= x; i++) {
        if (x % i == 0) {
            int cnt = 0;
            while (x % i == 0) x /= i, cnt++;
            sum *= cnt + 1;
            maxx = max(maxx, cnt * 2);
        }
    }
    if (x > 1) maxx = max(maxx, 2ll), sum *= 2;
    cout << max(maxx, sum) << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _;
    _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
}