算术基本定理:
正整数 N = p 1 c 1 ∗ p 2 c 2 ∗ . . . ∗ p m c m N = p_1^{c_1}*p_2^{c_2}*...*p_m^{c_m} N=p1c1∗p2c2∗...∗pmcm
约 数 个 数 = ( c 1 + 1 ) ∗ ( c 2 + 1 ) ∗ . . . ∗ ( c m + 1 ) = ∏ i = 1 m ( c i + 1 ) 约数个数=(c_1 + 1) * (c_2 + 1) * ... * (c_m + 1) = \prod _{i=1}^{m}(c_i+1) 约数个数=(c1+1)∗(c2+1)∗...∗(cm+1)=∏i=1m(ci+1)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <unordered_map>
using namespace std;
const int N = 1e6 + 10, mod = 1e9+7;
typedef long long ll;
int primes[N];
int n;
int main(){
scanf("%d",&n);
unordered_map<int,int> primes;
while(n--){
int x;
scanf("%d",&x);
for(int i = 2; i <= x/i; i++){
while(x % i == 0){//当i是x的约数时,来更新该约数的指数
x /= i;
primes[i]++;
}
}
if(x > 1) primes[x]++;//当是6时,分解成2^1*3^1
}
ll res = 1;
for(auto prime:primes) res = res % mod * (prime.second + 1) % mod;
printf("%lld\n",res);
return 0;
}