约数个数

#include<iostream>
#include<algorithm>
#include<unorder_map>
using namespace std;
typedef long long LL;
const int mod=1e9+7;
int main()
{
int n;
cin>>n;
unorder_map<int,int>primes;
while(m--)
{
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 prime:primes)res=res*(prime.second+1)%mod;
cout<<res<<endl;
return 0;
}