AcWing 871. 约数之和

#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 110, 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 p : primes) {
        LL a = p.first, b = p.second;//a是底数，b是指数
        LL t = 1;
        while (b -- ) t = (t * a + 1) % mod;//求和
        res = res * t % mod;
    }
    cout << res << endl;
    return 0;
}