#F2144. On Number of Decompositions into Multipliers
On Number of Decompositions into Multipliers
题目描述
You are given an integer m as a product of integers a1,a2,... an 
. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the input, must also be considered in the answer. As the answer can be very large, print it modulo 1000000007 (109+7).
The first line contains positive integer n (1≤n≤500). The second line contains space-separated integers a1,a2,...,an (1≤ai≤109).
In a single line print a single number k − the number of distinct decompositions of number m into n ordered multipliers modulo 1000000007 (109+7).
1
15
1
3
1 1 2
3
2
5 7
4
In the second sample, the get a decomposition of number 2, you need any one number out of three to equal 2, and the rest to equal 1.
In the third sample, the possible ways of decomposing into ordered multipliers are [7,5], [5,7], [1,35], [35,1].
A decomposition of positive integer m into n ordered multipliers is a cortege of positive integers b={b1,b2,... bn} such that 
. Two decompositions b and c are considered different, if there exists index i such that bi≠ci.
题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1746 题。保留原作者与原赛事署名。