摘要: GridlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5279 Accepted: 2907DescriptionBackground For years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are the "eas 阅读全文
posted @ 2011-11-21 16:46 w0w0 阅读(162) 评论(0) 推荐(0) 编辑
摘要: Big NumberTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20374 Accepted: 6472DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you ha 阅读全文
posted @ 2011-11-21 16:41 w0w0 阅读(166) 评论(0) 推荐(0) 编辑
摘要: IntersectionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7166 Accepted: 1836DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle. An example: line: start point: (4,9) end point: (11,2) rectangle: left-top: (1,5) right-bottom: 阅读全文
posted @ 2011-11-21 16:40 w0w0 阅读(144) 评论(0) 推荐(0) 编辑
摘要: FactorialTime Limit: 1500MS Memory Limit: 65536KTotal Submissions: 11237 Accepted: 6979DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone conne 阅读全文
posted @ 2011-11-21 16:39 w0w0 阅读(150) 评论(0) 推荐(0) 编辑
摘要: Cabric Number ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7858 Accepted: 2414DescriptionIf we input a number formed by 4 digits and these digits are not all of one same value, then it obeys the following law. Let us operate the number in the following way: (1) Arrange the digits 阅读全文
posted @ 2011-11-21 16:38 w0w0 阅读(191) 评论(0) 推荐(0) 编辑
摘要: Ugly NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15213 Accepted: 6714DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ... shows the first 10 ugly numbers. By convention, 1 is included. Given the integer n,wr 阅读全文
posted @ 2011-11-21 16:34 w0w0 阅读(130) 评论(0) 推荐(0) 编辑
摘要: MultiplyTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4634Accepted: 2466Description6*9 = 42" is not true for base 10, but is true for base 13. That is, 6(13) * 9(13) = 42(13) because 42(13) = 4 * 131 + 2 * 130 = 54(10). You are to write a program which inputs three integers p, q, and 阅读全文
posted @ 2011-11-21 12:03 w0w0 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Mileage BankTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 11515Accepted: 4779DescriptionMileage program of ACM (Airline of Charming Merlion) is really nice for the travelers flying frequently. Once you complete a flight with ACM, you can earn ACMPerk miles in your ACM Mileage Bank depende 阅读全文
posted @ 2011-11-21 11:00 w0w0 阅读(174) 评论(0) 推荐(0) 编辑
摘要: Word AmalgamationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6063Accepted: 3011DescriptionIn millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is 阅读全文
posted @ 2011-11-21 10:51 w0w0 阅读(164) 评论(0) 推荐(0) 编辑
摘要: Self NumbersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16385Accepted: 9189DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stands for digi 阅读全文
posted @ 2011-11-21 10:47 w0w0 阅读(125) 评论(0) 推荐(0) 编辑
摘要: The Hardest Problem EverTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 17235Accepted: 9509DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of the first c 阅读全文
posted @ 2011-11-21 10:35 w0w0 阅读(152) 评论(0) 推荐(0) 编辑
摘要: Tanning SalonTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5384Accepted: 2943DescriptionTan Your Hide, Inc., owns several coin-operated tanning salons. Research has shown that if a customer arrives and there are no beds available, the customer will turn around and leave, thus costing the 阅读全文
posted @ 2011-11-21 10:28 w0w0 阅读(225) 评论(0) 推荐(0) 编辑
摘要: SafecrackerTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1229Accepted: 763Description"The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fort 阅读全文
posted @ 2011-11-21 10:18 w0w0 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Magnificent MeatballsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5124Accepted: 3455DescriptionSam and Ella run a catering service. They like to put on a show when serving meatballs to guests seated at round tables. They march out of the kitchen with pots of meatballs and start serving a 阅读全文
posted @ 2011-11-21 10:16 w0w0 阅读(170) 评论(0) 推荐(0) 编辑
摘要: THE DRUNK JAILERTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 17539Accepted: 11167DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One night, the jailer gets bored and decides to play a gam 阅读全文
posted @ 2011-11-21 10:13 w0w0 阅读(159) 评论(0) 推荐(0) 编辑