A10289 | Move by Prime
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Pussycat Sonya has an array consisting of $n$ positive integers. There are $2^{n}$ possible subsequences of the array. For each subsequence she counts the minimum number of operations to make all its elements equal. Each operation must be one of two:
- Choose some element of the subsequence and multiply it by some prime number.
- Choose some element of the subsequence and divide it by some prime number. The chosen element must be divisible by the chosen prime number.
What is the sum of minimum number of operations for all $2^{n}$ possible subsequences? Find and print this sum modulo $10^{9}+7$ .
- Choose some element of the subsequence and multiply it by some prime number.
- Choose some element of the subsequence and divide it by some prime number. The chosen element must be divisible by the chosen prime number.
What is the sum of minimum number of operations for all $2^{n}$ possible subsequences? Find and print this sum modulo $10^{9}+7$ .
输入格式
The first line of the input contains a single integer $n$ ( $1<=n<=300000$ ) — the size of the array.
The second line contains $n$ integers $t_{1},t_{2},...,t_{n}$ ( $1<=t_{i}<=300000$ ) — elements of the array.
The second line contains $n$ integers $t_{1},t_{2},...,t_{n}$ ( $1<=t_{i}<=300000$ ) — elements of the array.
输出格式
Print the sum of minimum number of operation for all possible subsequences of the given array modulo $10^{9}+7$ .
输入输出样例
输入 #1
3 60 60 40
输出 #1
6
输入 #2
4 1 2 3 4
输出 #2
24
In the first sample, there are $8$ possible subsequences: $(60,60,40)$ , $(60,60)$ , $(60,40)$ , $(60,40)$ , $(60)$ , $(60)$ , $(40)$ and $()$ (empty subsequence).
For a subsequence $(60,60,40)$ we can make all elements equal by two operations — divide $40$ by $2$ to get $20$ , and then multiply $20$ by $3$ to get $60$ . It's impossible to achieve the goal using less operations and thus we add $2$ to the answer.
There are two subsequences equal to $(60,40)$ and for each of them the also need to make at least $2$ operations.
In each of other subsequences all numbers are already equal, so we need $0$ operations for each of them. The sum is equal to $2+2+2=6$ .
For a subsequence $(60,60,40)$ we can make all elements equal by two operations — divide $40$ by $2$ to get $20$ , and then multiply $20$ by $3$ to get $60$ . It's impossible to achieve the goal using less operations and thus we add $2$ to the answer.
There are two subsequences equal to $(60,40)$ and for each of them the also need to make at least $2$ operations.
In each of other subsequences all numbers are already equal, so we need $0$ operations for each of them. The sum is equal to $2+2+2=6$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted