def goodstr(s): n=len(s) if s.count(s[0])==n: return -1 elif s!=s[::-1]: return s else: m=n//2 j=m+1 while s[m]==s[j]: j+=1 return s[:m]+s[j]+s[m+1:j]+s[m]+s[j+1:]
for i in range(int(input())): print(goodstr(input()))
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
Prroblem 1093 B
def goodstr(s): n=len(s) if s.count(s[0])==n: return -1 elif s!=s[::-1]: return s else: m=n//2 j=m+1 while s[m]==s[j]: j+=1 return s[:m]+s[j]+s[m+1:j]+s[m]+s[j+1:]
for i in range(int(input())): print(goodstr(input()))
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
Puspak-Sahu | 2020-03-20 20:56:50 | 332 | Better solution than one in the tutorial (published) |
Name |
---|