上一页 1 ··· 28 29 30 31 32 33 34 35 36 ··· 41 下一页

HDU 1083 Courses

摘要: CoursesTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1888Accepted Submission(s): 848Problem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is 阅读全文
posted @ 2012-07-11 11:20 江财小子 阅读(266) 评论(0) 推荐(0) 编辑

POJ 1273 Drainage Ditches

摘要: Drainage DitchesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 40193Accepted: 14964DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regr 阅读全文
posted @ 2012-07-11 10:07 江财小子 阅读(145) 评论(0) 推荐(0) 编辑

HDU 2147 kiki's game

摘要: kiki's gameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 3365Accepted Submission(s): 1952Problem Description Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of th 阅读全文
posted @ 2012-07-11 09:26 江财小子 阅读(663) 评论(0) 推荐(0) 编辑

POJ 3070 Fibonacci

摘要: FibonacciTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6065Accepted: 4246DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formul 阅读全文
posted @ 2012-07-11 09:21 江财小子 阅读(487) 评论(0) 推荐(0) 编辑

HDU 1013 Digital Roots

摘要: Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29353Accepted Submission(s): 8974Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then tha 阅读全文
posted @ 2012-07-11 09:17 江财小子 阅读(1684) 评论(0) 推荐(0) 编辑

HDU 1198 Farm Irrigation

摘要: Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2492Accepted Submission(s): 1107Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are 阅读全文
posted @ 2012-07-10 16:36 江财小子 阅读(305) 评论(0) 推荐(0) 编辑

HDU 1856 More is better

摘要: More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 5725Accepted Submission(s): 2127Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. 阅读全文
posted @ 2012-07-10 10:18 江财小子 阅读(768) 评论(0) 推荐(0) 编辑

HDU 1213 How Many Tables

摘要: How Many TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5629Accepted Submission(s): 2662Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he need 阅读全文
posted @ 2012-07-10 09:03 江财小子 阅读(490) 评论(0) 推荐(0) 编辑

POJ 1363 Rails

摘要: RailsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 18531Accepted: 7391DescriptionThere is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish 阅读全文
posted @ 2012-07-10 01:16 江财小子 阅读(382) 评论(0) 推荐(0) 编辑

POJ 2442 Sequence

摘要: SequenceTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 5137Accepted: 1572DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then 阅读全文
posted @ 2012-07-09 23:45 江财小子 阅读(2308) 评论(0) 推荐(0) 编辑
上一页 1 ··· 28 29 30 31 32 33 34 35 36 ··· 41 下一页