重铸华农荣光 我辈义不容辞

The nineteenth day - Count of factor

#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> prime;
    while(n--){
        int x;
        cin>>x;
        for(int i=2;i<=x/i;i++)
        {
            while(x%i==0)
            {
                x/=i;
                prime[i]++;
            }
        }
        if(x>1) prime[x]++;
    }

    ll ans=1;
    for(auto x:prime) ans=ans*(x.second+1)%mod;
    cout<<ans;

    return 0;
}