摘要：
Primary ArithmeticTime Limit:1000MSMemory Limit:65536KTotal Submissions:7852Accepted:2962DescriptionChildren are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a 1 is carried from one digit position to be added to the ne 阅读全文
摘要：
BullseyeTime Limit:1000MSMemory Limit:65536KTotal Submissions:4123Accepted:1927DescriptionA simple dartboard consists of a flat, circular piece of cork with concentric rings drawn on it. Darts are thrown at the board by players in an attempt to hit the center of the dartboard (the Bullseye). The reg 阅读全文
摘要：
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 阅读全文