秋招模拟赛第29场|携程实习|2023.05.25
- Status
- Done
- Rule
- IOI
- Problem
- 3
- Start at
- 2023-6-19 19:00
- End at
- 2023-6-19 20:30
- Duration
- 1.5 hour(s)
- Host
- Partic.
- 11
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
塔子哥和朋友到郊外玩耍,偶然间,他获得n棵长度随机的竹子,他每次都会进行如下操作:·选择一棵正数高度的竹子,砍去二分之一的长度(结果向下取整)。请你帮塔子哥计算一下,他最少多少次操作可以使得所有竹子长度相等?
输入第—行为一个正整数n,代表共有 n 棵竹子。 输入第二行为 n 个正整数ai,代表第 i 棵竹子的长度。
1 ≤ n ≤ 100000 ,1 ≤ ai ≤ 109
—个整数,代表最少的操作次数。
输入
4
1 2 3 4
输出
4
输入
1
1024
输出
0
扫码备注加群即可,期待您的到来~
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.