A12704 | Make Equal
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given $n$ numbers $a_1, a_2, \dots, a_n$ . In one operation we can add to any one of those numbers a nonnegative integer power of $2$ .
What is the smallest number of operations we need to perform to make all $n$ numbers equal? It can be proved that under given constraints it doesn't exceed $10^{18}$ .
What is the smallest number of operations we need to perform to make all $n$ numbers equal? It can be proved that under given constraints it doesn't exceed $10^{18}$ .
输入格式
The first line contains a single integer $n$ ( $1 \le n \le 10^5$ ).
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $0 \le a_i \le 10^{17}$ ).
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $0 \le a_i \le 10^{17}$ ).
输出格式
Output exactly one integer — the smallest number of operations we need to perform to make all $n$ numbers equal.
输入输出样例
输入 #1
4 228 228 228 228
输出 #1
0
输入 #2
3 2 2 8
输出 #2
3
In the first example, all numbers are already equal. So the needed number of operation is $0$ .
In the second example, we can apply the operation $3$ times: add $8$ to first $2$ , add $8$ to second $2$ , add $2$ to $8$ , making all numbers equal to $10$ . It can be proved that we can't make all numbers equal in less than $3$ operations.
In the second example, we can apply the operation $3$ times: add $8$ to first $2$ , add $8$ to second $2$ , add $2$ to $8$ , making all numbers equal to $10$ . It can be proved that we can't make all numbers equal in less than $3$ operations.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted