摘要：Time Limit: 7000MSMemory Limit: 65536KTotal Submissions: 12873Accepted: 4518DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n dist... 阅读全文

摘要：brutal force1. 生成字典， 并按长度排序。2. 对于给定单词， 取得区间 [单词长度 - 1, 单词长度 + 1], 并匹配。3. 如果存在完全匹配的单词， 打印输出， 否则把可能的单词放到集合中。DescriptionYou, as a member of a development team for a new spell checking program, are to wri... 阅读全文