摘要： 编号统计时间限制：2000 ms | 内存限制：65535 KB难度：2描述zyc最近比较无聊，于是他想去做一次无聊的统计一下。他把全校同学的地址都统计了一下（zyc都将地址转化成了编码），然后他希望知道那个地方的同学最多(如果同学最多的地方有多个，输出编号最小的一个)。输入第一行输入一个正整数T（0<T<=11）表示有T组测试数据每组测试数据第一行输入一个正整数N（0<N<200000）表示有N个编号，随后输入N个编码（编码由数字组成且少于十位）输出每组数据输出占一行输出出现次数最多的编号样例输入1512345 456 45 78 78样例输出78 1 //2011- 阅读全文

摘要： Moving TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11406Accepted Submission(s): 3898Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 阅读全文

摘要： Wooden SticksTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6563Accepted Submission(s): 2707Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodwo 阅读全文

摘要： PacketsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 36663Accepted: 12207DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same h 阅读全文

摘要： 搬寝室Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9709Accepted Submission(s): 3266Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的 阅读全文