摘要: The 3n + 1 problemTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 39743Accepted: 12515DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm 阅读全文
posted @ 2011-11-21 10:12 w0w0 阅读(179) 评论(0) 推荐(0) 编辑
摘要: The TriangleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27017Accepted: 15824Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends so... 阅读全文
posted @ 2011-11-21 10:00 w0w0 阅读(184) 评论(0) 推荐(0) 编辑
摘要: ID CodesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4496Accepted: 2718DescriptionIt is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Gov 阅读全文
posted @ 2011-11-21 09:56 w0w0 阅读(201) 评论(0) 推荐(0) 编辑
摘要: Octal FractionsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5354Accepted: 2900DescriptionFractions in octal (base 8) notation can be expressed exactly in decimal notation. For example, 0.75 in octal is 0.953125 (7/8 + 5/64) in decimal. All octal numbers of n digits to the right of the oc 阅读全文
posted @ 2011-11-21 09:55 w0w0 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Simply SyntaxTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4310Accepted: 1897DescriptionIn the land of Hedonia the official language is Hedonian. A Hedonian professor had noticed that many of her students still did not master the syntax of Hedonian well. Tired of correcting the many synta 阅读全文
posted @ 2011-11-21 09:54 w0w0 阅读(181) 评论(0) 推荐(0) 编辑
摘要: Lining UpTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 16372Accepted: 5145Description"How am I ever going to solve this problem?" said the pilot. Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangerous area. Furthermore 阅读全文
posted @ 2011-11-21 09:52 w0w0 阅读(174) 评论(0) 推荐(0) 编辑
摘要: LC-DisplayTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12589Accepted: 4949DescriptionA friend of you has just bought a new computer. Until now, the most powerful computer he ever used has been a pocket calculator. Now, looking at his new computer, he is a bit disappointed, because he lik 阅读全文
posted @ 2011-11-21 09:51 w0w0 阅读(185) 评论(0) 推荐(0) 编辑
摘要: 487-3279Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 174382Accepted: 29865DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by d 阅读全文
posted @ 2011-11-21 09:28 w0w0 阅读(219) 评论(0) 推荐(0) 编辑
摘要: Flip and ShiftTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5669Accepted: 2604DescriptionThis puzzle consists of a random sequence of m black disks and n white disks on an oval-shaped track, with a turnstile capable of flipping (i.e., reversing) three consecutive disks. In Figure 1, there 阅读全文
posted @ 2011-11-21 09:25 w0w0 阅读(155) 评论(0) 推荐(0) 编辑
摘要: P,MTHBGWBTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5848Accepted: 3356DescriptionMorse code represents characters as variable length sequences of dots and dashes. In practice, characters in a message are delimited by short pauses. The following table shows the Morse code sequences: A.- 阅读全文
posted @ 2011-11-21 09:24 w0w0 阅读(229) 评论(0) 推荐(0) 编辑
摘要: Round and Round We GoTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9629Accepted: 4374DescriptionA cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the digits of the original number. That is, if you consider the n 阅读全文
posted @ 2011-11-21 09:22 w0w0 阅读(170) 评论(0) 推荐(0) 编辑
摘要: Color Me LessTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 24081Accepted: 11486DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit RGB color space 阅读全文
posted @ 2011-11-21 09:21 w0w0 阅读(372) 评论(0) 推荐(0) 编辑
摘要: Bode PlotTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9378Accepted: 6196DescriptionConsider the AC circuit below. We will assume that the circuit is in steady-state. Thus, the voltage at nodes 1 and 2 are given by v1 = VS coswt and v2 = VRcos (wt + q ) where VS is the voltage of the sour 阅读全文
posted @ 2011-11-21 09:20 w0w0 阅读(229) 评论(0) 推荐(0) 编辑
摘要: ParliamentTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13632Accepted: 5722DescriptionNew convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into disjoint groups of different sizes and every day each group 阅读全文
posted @ 2011-11-21 09:19 w0w0 阅读(181) 评论(0) 推荐(0) 编辑
摘要: Web NavigationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21520Accepted: 9479DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be r 阅读全文
posted @ 2011-11-21 09:17 w0w0 阅读(265) 评论(0) 推荐(0) 编辑