2014年3月7日
hdu 1061 暴力
摘要： Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29108Accepted Submission(s): 11115Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文
posted @ 2014-03-07 22:42 Ramanujan 阅读(296) 评论(0) 推荐(0) 编辑
hdu 2084 数塔
摘要： 数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18918Accepted Submission(s): 11276Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是 阅读全文
posted @ 2014-03-07 22:04 Ramanujan 阅读(201) 评论(0) 推荐(0) 编辑
hdu 1047
摘要： Integer InquiryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10588Accepted Submission(s): 2737Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文
posted @ 2014-03-07 00:03 Ramanujan 阅读(286) 评论(0) 推荐(0) 编辑