求约数个数还有约数之和

求约数个数我们要运用到（a1+1)(a2+1)...(ak+1)

 例如下列题目：

 

#include<bits/stdc++.h>
using namespace std;
const int N=110,mod=1e9+7;
typedef long long LL;
int main()
{
    int n;
    cin>>n;
    unordered_map<int, int> primes;
    while(n--)
    {
        int a;
        cin>>a;
        for(int i=2;i<=a/i;i++)
        {
            if(a%i==0)
            {
                a/=i;
                primes[i]++;
            }
            if(a>1) primes[a]++;
        }
    }
    LL res=1;
    for(auto x:primes) res=res*(x.second+1)%mod;
    cout<<res<<endl;
    return 0;
}

求约数之和：

#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;
        LL t = 1;
        while (b -- ) t = (t * a + 1) % mod;
        res = res * t % mod;
    }

    cout << res << endl;

    return 0;
}

 注：题目来自Acwing