C++

$\color{#cc33ff}{— > 算法基础课题解}$

约数个数：

约数之和：

$code:$

#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
const int mod = 1e9 + 7;

int main() {
    int n;
    cin >> n;

    unordered_map<int, int> primes; // 存储所有的指数和底数
    while (n --) {
        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 prime : primes) {
        int p = prime.first, a = prime.second;
        ll t = 1;
        while (a --) t = (t * p + 1) % mod;
        res = res * t % mod;
    }

    cout << res;

    return 0;
}