摘要：
ZOJ Problem Set - 3551BloodsuckerTime Limit:2 Seconds Memory Limit:65536 KBIn 0th day, there aren-1people and 1 bloodsucker. Every day, two and only t... 阅读全文
摘要：
DiceProblem DescriptionYou have a dice with m faces, each face contains a distinct number. We assume when we tossing the dice, each face will occur ra... 阅读全文
摘要：
RobotProblem DescriptionMichael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise... 阅读全文
摘要：
Card CollectorProblem DescriptionIn your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you... 阅读全文
摘要：
Check the difficulty of problemsTime Limit:2000MSMemory Limit:65536KTotal Submissions:4522Accepted:1993DescriptionOrganizing a programming contest is ... 阅读全文
摘要：
A Star not a Tree?Time Limit:1000MSMemory Limit:65536KTotal Submissions:3435Accepted:1724DescriptionLuke wants to upgrade his home computer network fr... 阅读全文
摘要：
FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2768Accepted:1412DescriptionConsider a single-elimination football tournament involving ... 阅读全文
摘要：
HHyper Prefix SetsPrefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of ... 阅读全文
摘要：
统计难题Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代... 阅读全文
摘要：
BeavergnawTime Limit:1000MSMemory Limit:65536KTotal Submissions:6203Accepted:4089DescriptionWhen chomping a tree the beaver cuts a very specific shape... 阅读全文