A9465 | On Number of Decompositions into Multipliers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an integer $m$ as a product of integers $a_{1},a_{2},...\ a_{n}$ . 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$ $(10^{9}+7)$ .
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$ $(10^{9}+7)$ .
输入格式
The first line contains positive integer $n$ ( $1<=n<=500$ ). The second line contains space-separated integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{9}$ ).
输出格式
In a single line print a single number $k$ — the number of distinct decompositions of number $m$ into $n$ ordered multipliers modulo $1000000007$ $(10^{9}+7)$ .
输入输出样例
输入 #1
1 15
输出 #1
1
输入 #2
3 1 1 2
输出 #2
3
输入 #3
2 5 7
输出 #3
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={b_{1},b_{2},...\ b_{n}}$ such that . Two decompositions $b$ and $c$ are considered different, if there exists index $i$ such that $b_{i}≠c_{i}$ .
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={b_{1},b_{2},...\ b_{n}}$ such that . Two decompositions $b$ and $c$ are considered different, if there exists index $i$ such that $b_{i}≠c_{i}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted