摘要：
Binomial ShowdownTime Limit:1000MSMemory Limit:65536KTotal Submissions:14048Accepted:4282DescriptionIn how many ways can you choose k elements out of n elements, not taking order into account?Write a program to compute this number.InputThe input will contain one or more test cases.Each test case con 阅读全文
摘要：
Sacrament of the sumTime Limit:1000MSMemory Limit:65536KTotal Submissions:1447Accepted:670Description— The Brother of mine, the Head of Monastic Order wants to know tomorrow about the results long-term researches. He wants to see neither more nor less than the Summering Machine! Even moreover, he wa 阅读全文
摘要：
BlocksTime Limit:1000MSMemory Limit:65536KTotal Submissions:5381Accepted:2555DescriptionDonald wishes to send a gift to his new nephew, Fooey. Donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. Each block is a cube, 1 inch by 1 inch by 1 inch. Donald wants 阅读全文
摘要：
Questions and answersTime Limit:1000MSMemory Limit:65536KTotal Submissions:7534Accepted:4044DescriptionThe database of the Pentagon contains a top-secret information. We don't know what the information is — you know, it's top-secret, — but we know the format of its representation. It is extr 阅读全文
摘要：
StampsTime Limit:2000MSMemory Limit:65536KTotal Submissions:6687Accepted:3105DescriptionBackgroundEverybody hates Raymond. He's the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately everybody loves Lucy, 阅读全文
摘要：
Rotten RopesTime Limit:1000MSMemory Limit:65536KTotal Submissions:4150Accepted:2697DescriptionSuppose we have n ropes of equal length and we want to use them to lift some heavy object. A tear-off weight t is associated to each rope, that is, if we try to lift an object, heavier than t with that rope 阅读全文
摘要：
Tour de FranceTime Limit:1000MSMemory Limit:65536KTotal Submissions:3418Accepted:1655DescriptionA racing bicycle is driven by a chain connecting two sprockets. Sprockets are grouped into two clusters: the front cluster (typically consisting of 2 or 3 sprockets) and the rear cluster (typically consis 阅读全文
摘要：
Mine SweeperTime Limit:1000MSMemory Limit:65536KTotal Submissions:5316Accepted:2074DescriptionThe game Minesweeper is played on an n by n grid. In this grid are hidden m mines, each at a distinct grid location. The player repeatedly touches grid positions. If a position with a mine is touched, the m 阅读全文
摘要：
小孩报数问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:5440Accepted:2646Description有N个小孩围成一圈，给他们从1开始依次编号，现指定从第W个开始报数，报到第S个时，该小孩出列，然后从下一个小孩开始报数，仍是报到S个出列，如此重复下去，直到所有的小孩都出列（总人数不足S个时将循环报数），求小孩出列的顺序。Input第一行输入小孩的人数N（N<=64）接下来每行输入一个小孩的名字(人名不超过15个字符)最后一行输入W,S (W < N)，用逗号","间隔Output按人名输 阅读全文
摘要：
Find the ClonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:5391Accepted:1998DescriptionDoubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human exper 阅读全文