A14819 | Equidistant Letters
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a string $s$ , consisting of lowercase Latin letters. Every letter appears in it no more than twice.
Your task is to rearrange the letters in the string in such a way that for each pair of letters that appear exactly twice, the distance between the letters in the pair is the same. You are not allowed to add or remove letters.
It can be shown that the answer always exists. If there are multiple answers, print any of them.
Your task is to rearrange the letters in the string in such a way that for each pair of letters that appear exactly twice, the distance between the letters in the pair is the same. You are not allowed to add or remove letters.
It can be shown that the answer always exists. If there are multiple answers, print any of them.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^3$ ) — the number of testcases.
Each testcase consists of a non-empty string $s$ , consisting of lowercase Latin letters. Every letter appears in the string no more than twice. The length of the string doesn't exceed $52$ .
Each testcase consists of a non-empty string $s$ , consisting of lowercase Latin letters. Every letter appears in the string no more than twice. The length of the string doesn't exceed $52$ .
输出格式
For each testcase, print a single string. Every letter should appear in it the same number of times as it appears in string $s$ . For each pair of letters that appear exactly twice, the distance between the letters in the pair should be the same.
If there are multiple answers, print any of them.
If there are multiple answers, print any of them.
输入输出样例
输入 #1
3 oelhl abcdcba ac
输出 #1
hello ababcdc ac
In the first testcase of the example, the only letter that appears exactly twice is letter 'l'. You can rearrange the letters arbitrarily, since there are no distances to compare.
In the second testcase of the example, the letters that appear exactly twice are 'a', 'b' and 'c'. Initially, letters 'a' are distance $6$ apart, letters 'b' are distance $4$ apart and letters 'c' are distance $2$ apart. They are not the same, so we have to rearrange the letters. After rearrangement, letters 'a' are distance $2$ apart, letters 'b' are distance $2$ apart and letters 'c' are distance $2$ apart. They are all the same, so the answer is valid.
In the third testcase of the example, there are no letters that appear exactly twice. Thus, any rearrangement is valid. Including not changing the string at all.
In the second testcase of the example, the letters that appear exactly twice are 'a', 'b' and 'c'. Initially, letters 'a' are distance $6$ apart, letters 'b' are distance $4$ apart and letters 'c' are distance $2$ apart. They are not the same, so we have to rearrange the letters. After rearrangement, letters 'a' are distance $2$ apart, letters 'b' are distance $2$ apart and letters 'c' are distance $2$ apart. They are all the same, so the answer is valid.
In the third testcase of the example, there are no letters that appear exactly twice. Thus, any rearrangement is valid. Including not changing the string at all.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted