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$棵长度随机的竹子，他每次都会进行如下操作:·选择一棵正数高度的竹子，砍去二分之一的长度（结果向下取整）。请你帮塔子哥计算一下，他最少多少次操作可以使得所有竹子长度相等?

输入描述