4476：Cut the rope

题目描述

　　Now we have some ropes. For each rope, you can cut it only once at any place, or you can also do nothing on it.
　　If we cut these ropes optimally, how many ropes we can get at most with the same length?

输入解释

　　There is an integer T (1 <= T <= 100) in the first line, indicates there are T test cases in total.
　　For each test case, the first integer N (1 <= N <= 100000) indicates there are N ropes. And then there are N integers whose value are all in [1, 100000], indicate the lengths of these ropes.

输出解释

　　For each test case, you should output one integer in one line, indicates that the number of ropes we can get at most with the same length if we cut these ropes optimally.

输入样例

输出样例

2
3
5

提示

　　For Sample 1, we can get two ropes with 0.5 unit length.
　　For Sample 2, we can get three ropes with 1 unit length.
　　For Sample 3, we can get five ropes with 1.5 unit length.

来自杭电HDUOJ的附加信息

Recommend

liuyiding

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 A Contest to Celebrate Girlfriend's Birthday by Staginner

源链接： HDU-4476

最后修改于 2020-10-25T23:13:53+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)