约数个数求解(唯一分解定理)(遍历map的写法！)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+50;
const int mod=1000000007;
const int inf=1e9;
int main()
{
    map<int,int>mp;
    int n;
    cin>>n;
    while(n--)
    {
        ll x;
        cin>>x;
        for(int i=2;i<=x/i;i++)
        {
            if(x%i==0)
            {            
                while(x%i==0)
                {
                    mp[i]++;
                    x=x/i;
                }
            }
        }
        if(x>1)
            mp[x]++;    
    }
    ll sum=1;
    for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)//!!!!!!!!!!!!!!!
    {
        sum=sum*(it->second+1)%mod;
    }
    cout<<sum<<endl;
}