2013 年 8月 15 日随笔档案 - ERKE

2013年8月15日

摘要： Phone ListTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7343Accepted Submission(s): 2525 Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone ca 阅读全文

posted @ 2013-08-15 10:34 ERKE 阅读(116) 评论(0) 推荐(0) 编辑

hdu1251字典树递归算法

摘要：统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 13831Accepted Submission(s): 5938 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatiu 阅读全文

posted @ 2013-08-15 09:29 ERKE 阅读(249) 评论(0) 推荐(0) 编辑

poj2337欧拉回路要求输出路径

摘要： CatenymsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8368Accepted: 2202DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gopher gopher.rat ra. 阅读全文

posted @ 2013-08-15 00:43 ERKE 阅读(248) 评论(0) 推荐(0) 编辑