2011年7月31日

HDU 一只小蜜蜂...

摘要： 一只小蜜蜂...Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 155 Accepted Submission(s): 92 Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中，蜂房的结构如下所示。Input输入数据的第一行是一个整数N,表示测试实例的个数，然后是N 行数据，每行包含两个整数a和b(0<a<b<50)。Outpu 阅读全文

posted @ 2011-07-31 11:03 NewPanderKing 阅读(322) 评论(1) 推荐(0)

HDU 下沙的沙子有几粒

摘要： 题目网址： http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=3&problemid=9分析，这题其实是H和D的组合排列问题，只不过要考虑期间累计的H和D的数量关系。用DP来做，可以推导出：dp[i][j] = dp[i-1][j] + dp[i][j-1]dp[][]前一个表示H的数量，后一个表示D的数量。分上面那种情况是因为最后一个必然是H或者D，而此时可以考虑把新加的一个放在最后，因为假如加的是H，如果加在[i-1][j]中加入H，则最后一个依然是H或D，此时如果成立，那么依然属 阅读全文

posted @ 2011-07-31 10:23 NewPanderKing 阅读(347) 评论(0) 推荐(0)

HDU Buy the Ticket

摘要： Buy the TicketTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 238 Accepted Submission(s): 128 Problem DescriptionThe \\\\\\\"Harry Potter and the Goblet of Fire\\\\\\\" will be on show in the next few days. As a crazy fan of Harry Potte 阅读全文

posted @ 2011-07-31 10:16 NewPanderKing 阅读(689) 评论(1) 推荐(0)

HDU Hat's Fibonacci

摘要： Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 268 Accepted Submission(s): 112 Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) 阅读全文

posted @ 2011-07-31 10:12 NewPanderKing 阅读(1101) 评论(0) 推荐(0)

HDU 小兔的棋盘

摘要： 小兔的棋盘Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 154 Accepted Submission(s): 102 Problem Des... 阅读全文

posted @ 2011-07-31 10:08 NewPanderKing 阅读(892) 评论(0) 推荐(0)

HDU How Many Trees

摘要： How Many Trees?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 163 Accepted Submission(s): 102 Problem DescriptionA binary search tree is a binary tree with root k such that any node v reachable from its left has label (v) <label (k) and any n 阅读全文

posted @ 2011-07-31 10:06 NewPanderKing 阅读(620) 评论(0) 推荐(0)

hdu Count the Trees

摘要： Count the Trees Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 135 Accepted Submission(s): 102 Problem DescriptionAnother common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common 阅读全文

posted @ 2011-07-31 10:04 NewPanderKing 阅读(425) 评论(0) 推荐(0)

HDU Exponentiation

摘要： ExponentiationTime Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 313 Accepted Submission(s): 100 Pro... 阅读全文

posted @ 2011-07-31 10:01 NewPanderKing 阅读(269) 评论(0) 推荐(0)

ＨＤＵ　A + B Problem II

摘要： A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 307 Accepted Submission(s): 147 Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of 阅读全文

posted @ 2011-07-31 09:59 NewPanderKing 阅读(677) 评论(0) 推荐(0)

导航