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 | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | cry | 160 |
2 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
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 |
---|