2011年7月26日
HDU 1028 Ignatius and the Princess III
摘要： Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4636 Accepted Submission(s): 3246Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says 阅读全文
posted @ 2011-07-26 20:19 贺佐安 阅读(313) 评论(0) 推荐(0)
HDU 2802 找单词
摘要： 找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1398 Accepted Submission(s): 1017Problem Description假设有x1个字母A， x2个字母B,..... x26个字母Z，同时假设字母A的价值为1，字母B的价值为2,..... 字母Z的价值为26。那么，对于给定的字母，可以找到多少价值<=50的单词呢？单词的价值就是组成一个单词的所有字母的价值之和，比如，单词ACM的价值是1+3+14= 阅读全文
posted @ 2011-07-26 19:37 贺佐安 阅读(393) 评论(0) 推荐(1)