![](https://img-blog.csdnimg.cn/20190927151101105.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
递归与递推
递归与递推
搞么子啊小子
这个作者很懒,什么都没留下…
展开
-
hdu 1207 汉诺塔II
汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4881 Accepted Submission(s): 2390Problem Description经典的汉诺塔问题经常作为一个递归的经典例原创 2014-07-31 21:09:38 · 814 阅读 · 0 评论 -
hdu 1249 三角形
三角形Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4766 Accepted Submission(s): 3251Problem Description用N个三角形最多可以把平面分成几个区域?原创 2014-07-29 12:00:28 · 967 阅读 · 0 评论 -
hdu 1143 Tri Tiling
Tri TilingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2112 Accepted Submission(s): 1206Problem DescriptionIn how many ways ca原创 2014-07-29 09:24:21 · 653 阅读 · 0 评论 -
hdu 1267 下沙的沙子有几粒?
下沙的沙子有几粒?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2718 Accepted Submission(s): 1425Problem Description2005年11月份,我们学校参加了ACM原创 2014-07-29 15:36:51 · 609 阅读 · 0 评论 -
hdu 2050 折线分割平面
折线分割平面Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16414 Accepted Submission(s): 11310Problem Description我们看到过很多直线分割平面的题原创 2014-07-24 20:41:26 · 804 阅读 · 0 评论 -
hdu 1013 Digital Roots
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 48348 Accepted Submission(s): 15029Problem DescriptionThe digita原创 2014-08-01 10:26:53 · 707 阅读 · 0 评论 -
poj 2506 Tiling
TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7454 Accepted: 3640DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?原创 2014-07-08 16:27:50 · 738 阅读 · 0 评论 -
hdu 1290 献给杭电五十周年校庆的礼物
献给杭电五十周年校庆的礼物Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7236 Accepted Submission(s): 3936Problem Description或许你曾经牢骚满腹或原创 2014-07-24 21:11:04 · 875 阅读 · 0 评论 -
hdu 2512 一卡通的冒险
#includeint dp[2002][2002];int c[2002];int main (){ int i,j,n,b; for(i=1;i2000;i++) dp[i][i]=dp[i][1]=1; for(i=2;i2000;i++) for(j=2;j2000;j++) dp[i][j]=(dp[i-1][j-1]+dp[i-1原创 2014-05-24 16:48:39 · 612 阅读 · 0 评论 -
hdu 1297 Children’s Queue
Children’s QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10540 Accepted Submission(s): 3390Problem DescriptionThere ar原创 2014-08-01 17:08:09 · 751 阅读 · 0 评论