上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 28 下一页
摘要: Quick ChangeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4756Accepted: 3491DescriptionJ.P. Flathead’s Grocery Store hires cheap labor to man the checkout stations. The people he hires (usually high school kids) often make mistakes making change for the customers. Flathead, who’s a bit of 阅读全文
posted @ 2011-11-23 09:47 w0w0 阅读(222) 评论(0) 推荐(0) 编辑
摘要: Triangular SumsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5361Accepted: 3788DescriptionThe nth Triangular number, T(n) = 1 + … + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side. For example T(4):XX XX X XX X X XWrite a progr 阅读全文
posted @ 2011-11-23 09:47 w0w0 阅读(400) 评论(0) 推荐(0) 编辑
摘要: RoundersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6316Accepted: 4081DescriptionFor a given number, if greater than ten, round it to the nearest ten, then (if that result is greater than 100) take the result and round it to the nearest hundred, then (if that result is greater than 1000 阅读全文
posted @ 2011-11-23 09:46 w0w0 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Celebrity jeopardyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11429Accepted: 6421DescriptionIt's hard to construct a problem that's so easy that everyone will get it, yet still difficult enough to be worthy of some respect. Usually, we err on one side or the other. How simple ca 阅读全文
posted @ 2011-11-23 09:45 w0w0 阅读(133) 评论(0) 推荐(0) 编辑
摘要: Card TrickTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2838Accepted: 2092DescriptionThe magician shuffles a small pack of cards, holds it face down and performs the following procedure:The top card is moved to the bottom of the pack. The new top card is dealt face up onto the table. It i 阅读全文
posted @ 2011-11-22 13:58 w0w0 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Dirichlet's Theorem on Arithmetic ProgressionsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10814Accepted: 5388DescriptionIf a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + 4d, ..., conta 阅读全文
posted @ 2011-11-22 13:57 w0w0 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Nasty HacksTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9031Accepted: 6352DescriptionYou are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may use to fool their friends. The company has just finished their first product and it is t 阅读全文
posted @ 2011-11-22 13:57 w0w0 阅读(228) 评论(0) 推荐(0) 编辑
摘要: DivisorsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7846Accepted: 2163DescriptionYour task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for such a useful computation?InputThe input consists of several instances. Each in 阅读全文
posted @ 2011-11-22 13:56 w0w0 阅读(175) 评论(0) 推荐(0) 编辑
摘要: Ball bearingsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2766Accepted: 1592DescriptionThe Swedish company SKF makes ball bearings. As explained by Britannica Online, a ball bearing is "one of the two types of rolling, or anti friction, bearings (the other is the roller bearing). It 阅读全文
posted @ 2011-11-22 13:55 w0w0 阅读(167) 评论(0) 推荐(0) 编辑
摘要: ScrabbleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1634Accepted: 929DescriptionThe game of Scrabble is played with tiles. A tile either has a single letter written on it, or it is blank. In the latter case, the tile may be used to represent a letter of your choice. On your turn, you ar 阅读全文
posted @ 2011-11-22 13:55 w0w0 阅读(233) 评论(0) 推荐(0) 编辑
摘要: Gauß in Elementary SchoolTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7610Accepted: 3440DescriptionJohann Carl Friedrich Gauß (1777 – 1855) was one of the most important German mathematicians. For those of you who remember the Deutsche Mark, a picture of him was printed on the 阅读全文
posted @ 2011-11-22 13:54 w0w0 阅读(223) 评论(0) 推荐(0) 编辑
摘要: Homogeneous SquaresTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 3344Accepted: 1808DescriptionAssume you have a square of size n that is divided into n × n positions just as a checkerboard. Two positions (x1, y1) and (x2, y2), where 1 ≤ x1, y1, x2, y2 ≤ n, are called “independent” if 阅读全文
posted @ 2011-11-22 13:54 w0w0 阅读(285) 评论(0) 推荐(0) 编辑
摘要: Goldbach's ConjectureTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8274Accepted: 4779DescriptionFor any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such thatn = p1 + p2This conjecture has not been proved nor refused yet. No one i 阅读全文
posted @ 2011-11-22 13:53 w0w0 阅读(175) 评论(0) 推荐(0) 编辑
摘要: Ancient KeyboardTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2785Accepted: 1541DescriptionThe scientists have found an ancient device that works in a strange way. The device has a keyboard and an output tape. The keyboard has 26 keys, with symbols 'A' through 'Z' on them. 阅读全文
posted @ 2011-11-22 13:52 w0w0 阅读(282) 评论(0) 推荐(0) 编辑
摘要: Best SMS to TypeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3631Accepted: 1518DescriptionUsing SMS today is more than a pleasing hobby. As the number of messages one sends through this service grows, the need to type them fast is better felt. Sometimes, one wonders how fast a message ca 阅读全文
posted @ 2011-11-22 13:52 w0w0 阅读(201) 评论(0) 推荐(0) 编辑
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 28 下一页