上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 24 下一页
摘要: Babelfish Problem Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language 阅读全文
posted @ 2014-08-06 13:26 Wurq 阅读(132) 评论(0) 推荐(0)
该文被密码保护。 阅读全文
posted @ 2014-08-06 13:26 Wurq 阅读(2) 评论(0) 推荐(0)
该文被密码保护。 阅读全文
posted @ 2014-08-06 13:25 Wurq 阅读(1) 评论(0) 推荐(0)
摘要: 统计难题 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10 阅读全文
posted @ 2014-08-06 13:24 Wurq 阅读(182) 评论(0) 推荐(0)
摘要: Max SumTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25Accepted Submission(s) : 15Problem Descrip... 阅读全文
posted @ 2014-08-06 13:19 Wurq 阅读(171) 评论(0) 推荐(0)
摘要: Bone CollectorTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 11Accepted Submission(s) : 10Problem ... 阅读全文
posted @ 2014-08-06 13:17 Wurq 阅读(195) 评论(0) 推荐(0)
摘要: To The MaxTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 7Problem Descr... 阅读全文
posted @ 2014-08-06 13:15 Wurq 阅读(140) 评论(0) 推荐(0)
摘要: Number Sequence Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N 阅读全文
posted @ 2014-08-03 17:42 Wurq 阅读(127) 评论(0) 推荐(0)
摘要: Count the string Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string 阅读全文
posted @ 2014-08-03 17:36 Wurq 阅读(195) 评论(0) 推荐(0)
摘要: Frogs' NeighborhoodTime Limit : 10000/5000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 27Accepted Submission(s) : 17Sp... 阅读全文
posted @ 2014-08-03 17:12 Wurq 阅读(458) 评论(0) 推荐(0)
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 24 下一页