约数个数与约数和

//求n个正整数乘积的约数个数与约数之和
#include<iostream>
#include<unordered_map>
#include<algorithm>
typedef long long ll;
using namespace std;
const int M = 1e9+7;

int main()
{
    int n;
    scanf("%d", &n);
    
    unordered_map<int, int> primes;
    
    while(n--)
    {
        int x;
        scanf("%d", &x);
        
        for (int i = 2; i <= x; i++)
        {
            if (x % i == 0)
            {
                while(x % i == 0)
                {
                    x /= i;
                    primes[i]++;
                }
            }
        }
        if (x > 1) primes[x]++;
    }
    ll res1 = 1;
    
    for (auto prime : primes) res1 = res1 * (1+prime.second) % M;
    printf("约数的个数 = %d\n", res1);
    
    ll res2 = 1;
    for (auto prime : primes)
    {
        int p = prime.first, a = prime.second; //p代表底数 a代表次数
        ll t = 1;
        while (a--) t = (t * p + 1) % M;
        res2 = res2 * t % M;
    }
    printf("约数之和 = %d\n", res2);
    return 0; 
}

例如：