Prefix-Suffix Palindrome (Easy version)

This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.

You are given a string $s$, consisting of lowercase English letters. Find the longest string, $t$, which satisfies the following conditions:

• The length of $t$ does not exceed the length of $s$.
• $t$ is a palindrome.
• There exists two strings $a$ and $b$ (possibly empty), such that $t = a + b$ ( “$+$” represents concatenation), and $a$ is prefix of $s$ while $b$ is suffix of $s$.

Input

The input consists of multiple test cases. The first line contains a single integer $t$ ($1 \leq t \leq 1000$), the number of test cases. The next $t$ lines each describe a test case.

Each test case is a non-empty string $s$, consisting of lowercase English letters.

It is guaranteed that the sum of lengths of strings over all test cases does not exceed $5000$.Output

For each test case, print the longest string which satisfies the conditions described above. If there exists multiple possible solutions, print any of them.Exampleinput

5
a
abcdfdcecba
abbaxyzyx
codeforces
acbba

output

a
abcdfdcba
xyzyx
c
abba

Note

In the first test, the string $s = $”a” satisfies all conditions.

In the second test, the string “abcdfdcba” satisfies all conditions, because:

• Its length is $9$, which does not exceed the length of the string $s$, which equals $11$.
• It is a palindrome.
• “abcdfdcba” $=$ “abcdfdc” $+$ “ba”, and “abcdfdc” is a prefix of $s$ while “ba” is a suffix of $s$.

It can be proven that there does not exist a longer string which satisfies the conditions.

In the fourth test, the string “c” is correct, because “c” $=$ “c” $+$ “” and $a$ or $b$ can be empty. The other possible solution for this test is “s”.

#include <bits/stdc++.h>

using namespace std;

template <typename T>
vector<int> manacher(int n, const T &s) {
if (n == 0) {
return vector<int>();
}
vector<int> res(2 * n - 1, 0);
int l = -1, r = -1;
for (int z = 0; z < 2 * n - 1; z++) {
    int i = (z + 1) >> 1;
int j = z >> 1;
int p = (i >= r ? 0 : min(r - i, res[2 * (l + r) - z]));
while (j + p + 1 < n && i - p - 1 >= 0) {
if (!(s[j + p + 1] == s[i - p - 1])) {
break;
}
p++;
}
if (j + p > r) {
l = i - p;
r = j + p;
}
res[z] = p;
}
return res;
}

template <typename T>
vector<int> manacher(const T &s) {
return manacher((int) s.size(), s);
}

int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
string s;
cin >> s;
int n = (int) s.size();
vector<int> res = manacher(s);
int match = 0;
while (2 * match + 2 <= n && s[match] == s[n - 1 - match]) {
      match += 1;
    }
    int ans = 0;
    int afrom = 0;
    for (int z = 0; z <= 2 * n - 2; z++) {
      int i = (z + 1) >> 1;
int j = z >> 1;
if (i > j && res[z] == 0) {
continue;
}
int from = i - res[z];
int to = j + res[z];
if (from < match) {
        int shift = match - from;
        from += shift;
        to -= shift;
      }
      if (to >= n - match) {
int shift = to - (n - match) + 1;
from += shift;
to -= shift;
}
if (from != match && to != n - match - 1) {
continue;
}
if (to - from + 1 > ans) {
ans = to - from + 1;
afrom = from;
}
}
cout << (s.substr(0, match) + s.substr(afrom, ans) + s.substr(n - match, match)) << '\n';
  }
  return 0;
}