A10259 | Multipliers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Ayrat has number $n$ , represented as it's prime factorization $p_{i}$ of size $m$ , i.e. $n=p_{1}·p_{2}·...·p_{m}$ . Ayrat got secret information that that the product of all divisors of $n$ taken modulo $10^{9}+7$ is the password to the secret data base. Now he wants to calculate this value.
输入格式
The first line of the input contains a single integer $m$ ( $1<=m<=200000$ ) — the number of primes in factorization of $n$ .
The second line contains $m$ primes numbers $p_{i}$ ( $2<=p_{i}<=200000$ ).
The second line contains $m$ primes numbers $p_{i}$ ( $2<=p_{i}<=200000$ ).
输出格式
Print one integer — the product of all divisors of $n$ modulo $10^{9}+7$ .
输入输出样例
输入 #1
2 2 3
输出 #1
36
输入 #2
3 2 3 2
输出 #2
1728
In the first sample $n=2·3=6$ . The divisors of $6$ are $1$ , $2$ , $3$ and $6$ , their product is equal to $1·2·3·6=36$ .
In the second sample $2·3·2=12$ . The divisors of $12$ are $1$ , $2$ , $3$ , $4$ , $6$ and $12$ . $1·2·3·4·6·12=1728$ .
In the second sample $2·3·2=12$ . The divisors of $12$ are $1$ , $2$ , $3$ , $4$ , $6$ and $12$ . $1·2·3·4·6·12=1728$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted