题目描述

include [HTML_REMOVED]

include [HTML_REMOVED]

include [HTML_REMOVED]

using namespace std;
typedef long long LL;
const int N = 110, mod = 1e9 + 7;
int main()
{
int n;
cin >> n;
map[HTML_REMOVED] 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;

}

blablabla

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla

算法2

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla