摘要：
AntsTime Limit:1000MSMemory Limit:30000KTotal Submissions:6418Accepted:3010DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and sta 阅读全文
摘要：
Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 180Accepted Submission(s): 56 Problem Description IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a L. 阅读全文
摘要：
Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1079Accepted Submission(s): 416 Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily,. 阅读全文
摘要：
ZOJ 1610:http://www.cnblogs.com/lzj-0218/p/3458222.htmlZOJ 3551: http://www.cnblogs.com/lzj-0218/p/3219716.html 阅读全文
摘要：
BloodsuckerTime Limit:2 Seconds Memory Limit:65536 KBIn 0th day, there aren-1people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsucker meets a bloodsucker. Otherwise, people may be transf 阅读全文