本文介绍了一个关于寻找与给定AC字符串所有子串不同的字典序最小字符串的问题。输入为仅包含'A'和'C'的字符串S，长度不超过100。目标是找出与S的所有子串都不相同的字典序最小字符串T。
Description
As a former ACMer, "AC" is a special abbreviated word which can bring much pleasure to me. Sometimes it means everything.
This problem is about "AC".
One day, I write a long string S on the paper which contains "A" and "C". Now I want to find a lexicographic minimum string T satisfied that T is distinct with all substring of S.
This problem is about "AC".
One day, I write a long string S on the paper which contains "A" and "C". Now I want to find a lexicographic minimum string T satisfied that T is distinct with all substring of S.
Input
The first line of input file contains an integer T indicating the number of case.
In each test case:
Input a string S consist of "A" and "C". The length of S is not large than 100.
In each test case:
Input a string S consist of "A" and "C". The length of S is not large than 100.
Output
For each test case:
You should output the string T meet the condition.
You should output the string T meet the condition.
Sample Input
1 ACAC
Sample Output
AA 这题题目比较难看懂 字典序最小的是A 最小字串的概念当时没懂 题目就是最小的都是A的字串 ACAC最小都是A的字串是A 所以是AA
扫一扫
352
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
