309907: CF1758A. SSeeeeiinngg DDoouubbllee
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
SSeeeeiinngg DDoouubbllee
题意翻译
## 题目描述 给你一个字符串,现在将该字符串的每一元素后添加同一个元素,例如字符串 `abc` 变成 `aabbcc`,现在让你输出这个字符串重排列后可得到的的回文字符串。题目描述
A palindrome is a string that reads the same backward as forward. For example, the strings $ \texttt{z} $ , $ \texttt{aaa} $ , $ \texttt{aba} $ , and $ \texttt{abccba} $ are palindromes, but $ \texttt{codeforces} $ and $ \texttt{ab} $ are not. The double of a string $ s $ is obtained by writing each character twice. For example, the double of $ \texttt{seeing} $ is $ \texttt{sseeeeiinngg} $ . Given a string $ s $ , rearrange its double to form a palindrome. Output the rearranged string. It can be proven that such a rearrangement always exists.输入输出格式
输入格式
The first line of input contains $ t $ ( $ 1 \leq t \leq 1000 $ ) — the number of test cases. The only line of each test case contains a single string $ s $ ( $ 1 \leq |s| \leq 100 $ ) consisting only of lowercase English letters. Note that the sum of $ |s| $ over all test cases is not bounded.
输出格式
For each test case, output a palindromic string of length $ 2 \cdot |s| $ that is a rearrangement of the double of $ s $ .
输入输出样例
输入样例 #1
4
a
sururu
errorgorn
anutforajaroftuna
输出样例 #1
aa
suurruurruus
rgnororerrerorongr
aannuuttffoorraajjaarrooffttuunnaa