摘要:
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... 阅读全文
摘要:
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 ... 阅读全文
摘要:
BeavergnawTime Limit:1000MSMemory Limit:65536KTotal Submissions:6203Accepted:4089DescriptionWhen chomping a tree the beaver cuts a very specific shape... 阅读全文