摘要: 统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 11471 Accepted Submission(s): 4824 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignat 阅读全文
posted @ 2012-12-18 22:43 Jack Ge 阅读(337) 评论(0) 推荐(0) 编辑
摘要: 确定比赛名次Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 24 Accepted Submission(s) : 17Problem Description有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排 阅读全文
posted @ 2012-12-18 21:48 Jack Ge 阅读(265) 评论(0) 推荐(0) 编辑
摘要: Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9149 Accepted Submission(s): 3383 Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect 阅读全文
posted @ 2012-12-18 17:44 Jack Ge 阅读(3784) 评论(0) 推荐(0) 编辑
摘要: The Euler functionTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 26 Accepted Submission(s) : 16Problem DescriptionThe Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller 阅读全文
posted @ 2012-12-18 14:29 Jack Ge 阅读(1802) 评论(0) 推荐(0) 编辑