wilver的博客

Description有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。 球赛的规则如下： 如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。 如果A打败了B，B又打败了C，而且，C又打败了A，那么A、B、C三者都不可能成为冠军。 根据这个规则，无需循环较量，或许就能确定冠军。你的任务就是面对一群比赛选手，在经过了若干场撕杀之后，确

A Sweet JourneyProblem Description Master Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as a line segment of length L, is a road of swamps and flats. In the sw

It’s time to fight the local despots and redistribute the land. There is a rectangular piece of land granted from the government, whose length and width are both in binary form. As the mayor, you must

Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.Mr Wang

Problem DescriptionA checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are often u

出处：http://blog.youkuaiyun.com/a1dark问题描述 :夏天来了好开心啊,呵呵,好多好多水果 Joe经营着一个不大的水果店.他认为生存之道就是经营最受顾客欢迎的水果.现在他想要一份水果销售情况的明细表,这样Joe就可以很容易掌握所有水果的销售情况了. 输入:第一行正整数N(0《N《=10)表示有N组测试数据. 每组测试数据的第一行是一个整数M(0《M《=100),表示工有M次