随笔分类 -  Dynamic programming

动态规划（dp）
hdu1054
摘要：Strategic Game Time Limit: 10000ms Memory Limit: 32768KB This problem will be judged on HDU. Original ID: 1054 64-bit integer IO format: %lld Java cla 阅读全文
posted @ 2016-09-28 19:48 Yan_Bin 阅读(324) 评论(0) 推荐(0) 编辑
UVa10253
摘要：10253 Series-Parallel NetworksIn this problem you are expected to count two-terminal series-parallel networks. These are electricnetworks considered t 阅读全文
posted @ 2016-08-26 11:48 Yan_Bin 阅读(627) 评论(0) 推荐(0) 编辑
UVa11361
摘要：Investigating Div-Sum Property Aninteger is divisible by 3 if the sum of its digits is also divisible by 3. Forexample, 3702 is divisible by 3 and 12( 阅读全文
posted @ 2016-08-25 11:25 Yan_Bin 阅读(184) 评论(0) 推荐(0) 编辑
LA 3516
摘要：Exploring Pyramids Archaeologists have discovered a new set of hidden caves in one of the Egyptian pyramids. The decryption of ancient hieroglyphs on 阅读全文
posted @ 2016-08-24 23:02 Yan_Bin 阅读(138) 评论(0) 推荐(0) 编辑
UVa11137
摘要：Ingenuous Cubrency People in Cubeland use cubic coins. Not only the unit of currency is called acube but also the coins are shaped like cubes and thei 阅读全文
posted @ 2016-08-24 18:46 Yan_Bin 阅读(242) 评论(0) 推荐(0) 编辑
UVa11375
摘要：Matches We can make digits with matches as shown below: Given N matches, find the number of different numbers representable using the matches. We shal 阅读全文
posted @ 2016-08-24 16:42 Yan_Bin 阅读(314) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示