2013年5月23日
HDU 1247 Hat’s Words(字典树)
摘要： Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5178 Accepted Submission(s): 1934 Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find al.. 阅读全文
posted @ 2013-05-23 22:52 Dreamcaihao 阅读(224) 评论(0) 推荐(0) 编辑
HDU 1075 What Are You Talking About(字典树)
摘要： What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 9488 Accepted Submission(s): 2961 Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Mart 阅读全文
posted @ 2013-05-23 21:37 Dreamcaihao 阅读(150) 评论(0) 推荐(0) 编辑
HDU 1251 统计难题(字典树)
摘要： 统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 12855 Accepted Submission(s): 5433 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Igna. 阅读全文
posted @ 2013-05-23 19:36 Dreamcaihao 阅读(162) 评论(0) 推荐(0) 编辑