随笔分类 -  简单题

HDU 4749 Parade Show(2013 ACM/ICPC Asia Regional Nanjing Online)
摘要:Parade ShowTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)描述2013 is the 60 anniversary of Nanjing University of Science and Technology, and today happens to be the anniversary date. On this happy festival, school authority hopes that the new students to be trained for 阅读全文

posted @ 2013-09-21 20:34 落叶伴雨下 阅读(552) 评论(6) 推荐(0)

玩叠骰子
摘要:玩叠骰子时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte描述大家都玩过骰子吧,骰子一般都被用来赌博的工具,但是我们ACM的成员不一样。我们可以用骰子来编写出各种各样的题目,给广大爱好ACM的人锻炼思考问题的能力。看看骰子: 很熟悉吧o(∩_∩)o ~~~ 废话不多说我们看题:现在给你n个骰子,把他们规范的叠起来,叠好后会有一些骰子的面被遮住,现在问你怎么叠没被遮住的那些面的点数和最大? 说明:叠的时候不能错开的叠,也就是说两个面要满满的叠住。并且叠在地上的那面也算被遮住的。Do you know?上面这个叠法就不合法。 骰子:每个面点数分别是:1.. 阅读全文

posted @ 2013-09-17 16:22 落叶伴雨下 阅读(979) 评论(0) 推荐(0)

Number Steps
摘要:Number Steps时间限制(普通/Java):3000MS/10000MS 运行内存限制:65536KByte 描述Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued. Y 阅读全文

posted @ 2013-09-16 21:07 落叶伴雨下 阅读(233) 评论(0) 推荐(0)

导航