木槿花非花的博客

Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest

Problem Description Given a string containing only 'A' - 'Z', we could encode it using the following method:  1. Each sub-string containing k same characters should be encoded to "kX" where "X"

题目描述 有一些关键字，现在给你一个字符串，请你根据此字符串，将关键字根据相关关系排列方便检索。1 字符串长度相同的关键字才有关系(每组的长度都不相同,互不影响 )，两个字符串在相同位置的相同字符越多则关系越密切，若一样多则字典序越小越密切。 输入 多行(少于101)，每行一个字符串（只含小写字母，长度不超过1000）,连续多行的字符个数相同，视为一组输出，每组的最后一个字符为给你的字符串