2012年8月4日

HDU 1251 统计难题(字典树)

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

posted @ 2012-08-04 23:22 kuangbin 阅读(2627) 评论(0) 推荐(0) 编辑

HDU 1789 Doing Homework again(排序,DP)

摘要: Doing Homework againTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2969Accepted Submission(s): 1707Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline 阅读全文

posted @ 2012-08-04 19:15 kuangbin 阅读(5064) 评论(0) 推荐(1) 编辑

HDU 1492 The number of divisors(约数) about Humble Numbers(数论,简单约数)

摘要: The number of divisors(约数) about Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1623Accepted Submission(s): 789Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 阅读全文

posted @ 2012-08-04 15:27 kuangbin 阅读(389) 评论(0) 推荐(0) 编辑

HDU 1716 排列2(排列生成,,next_permutation())

摘要: 排列2Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2554Accepted Submission(s): 991Problem DescriptionRay又对数字的列产生了兴趣:现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。Input每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组成 阅读全文

posted @ 2012-08-04 15:17 kuangbin 阅读(714) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: