摘要：
OnesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8948Accepted: 5061DescriptionGiven any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?Input 阅读全文
posted @ 2011-11-22 12:30
w0w0
阅读(117)
评论(0)
推荐(0)
摘要：
WERTYUTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6731Accepted: 3121Description A common typing error is to place the hands on the keyboard one row to the right of the correct position. So "Q" is typed as "W" and "J" is typed as "K" and so on. You 阅读全文
posted @ 2011-11-22 12:29
w0w0
阅读(215)
评论(0)
推荐(0)
摘要：
Hamming ProblemTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5626Accepted: 2528DescriptionFor each three prime numbers p1, p2 and p3, let's define Hamming sequence Hi(p1, p2, p3), i=1, ... as containing in increasing order all the natural numbers whose only prime divisors are p1, p2 o 阅读全文
posted @ 2011-11-22 12:29
w0w0
阅读(234)
评论(0)
推荐(0)
摘要：
Very Simple ProblemTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3250Accepted: 1211DescriptionDuring a preparation of programming contest, its jury is usually faced with many difficult tasks. One of them is to select a problem simple enough to most, if not all, contestants to solve. The d 阅读全文
posted @ 2011-11-22 12:28
w0w0
阅读(209)
评论(0)
推荐(0)
摘要：
Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 15693Accepted: 7549DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your universi 阅读全文
posted @ 2011-11-22 12:27
w0w0
阅读(177)
评论(0)
推荐(0)
摘要：
Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20871Accepted: 9020DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 < 阅读全文
posted @ 2011-11-22 12:27
w0w0
阅读(139)
评论(0)
推荐(0)
摘要：
How much did the businessman loseTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8907Accepted: 5982DescriptionBusinessmen, of course, can make much money. However, sometimes, they would lose money in trading. For example, Jame, a businessman, brought in some goods each cost him 40 yuan and 阅读全文
posted @ 2011-11-22 12:26
w0w0
阅读(184)
评论(0)
推荐(0)
摘要：
Crossed laddersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3984Accepted: 1555DescriptionA narrow street is lined with tall buildings. An x foot long ladder is rested at the base of the building on the right side of the street and leans on the building on the left side. A y foot long lad 阅读全文
posted @ 2011-11-22 12:25
w0w0
阅读(225)
评论(0)
推荐(0)
摘要：
Peter's smokesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15268Accepted: 6171DescriptionPeter has n cigarettes. He smokes them one by one keeping all the butts. Out of k > 1 butts he can roll a new cigarette. How many cigarettes can Peter have?InputInput is a sequence of lines. E 阅读全文
posted @ 2011-11-22 12:25
w0w0
阅读(225)
评论(0)
推荐(0)
摘要：
BabelfishTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 21485Accepted: 9215DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.InputInput consists 阅读全文
posted @ 2011-11-22 12:24
w0w0
阅读(132)
评论(0)
推荐(0)
摘要：
StuPIdTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 5786Accepted: 2990DescriptionBackground At DUT, the Dreamland University of Technology, all students have personal id, numbers with six or seven digits. But they're not just any numbers. Only those that have a checksum with a zero as 阅读全文
posted @ 2011-11-22 12:22
w0w0
阅读(185)
评论(0)
推荐(0)
摘要：
Binary TreeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4526Accepted: 2124DescriptionBackground Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like t 阅读全文
posted @ 2011-11-22 12:22
w0w0
阅读(171)
评论(0)
推荐(0)
摘要：
StrategiesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2385Accepted: 1163DescriptionBackground Bill, Steve and Linus participate in programming contests just like the one you're competing in right now. They have different strategies and we’d like to find out whose strategy is the bes 阅读全文
posted @ 2011-11-22 12:21
w0w0
阅读(193)
评论(0)
推荐(0)
摘要：
Scavenger HuntTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2145Accepted: 1176DescriptionBackground Bill has been the greatest boy scout in America and has become quite a superstar because he always organized the most wonderful scavenger hunts (you know, where the kids have to find a cert 阅读全文
posted @ 2011-11-22 12:20
w0w0
阅读(193)
评论(0)
推荐(0)
摘要：
StampsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7032Accepted: 3269DescriptionBackground Everybody 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 L 阅读全文
posted @ 2011-11-22 12:19
w0w0
阅读(260)
评论(0)
推荐(0)
浙公网安备 33010602011771号