competitive-programming/Codforces/prefixSuffixPalindromeEasy.cpp at master · fcnoronha/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)

#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define ms(x, i) memset(x, i, sizeof(x))
//codeforces.com/contest/1326/problem/D1


#define p(x) cout << x << "\n"
#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]

#define f first
#define s second

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f;

int main() {
    fastio;

    int t;
    cin >> t;

    while (t--) {

        string s;
        cin >> s;

        vector<char> ans(s.size(), '&');
        if (s.size() == 1) {
            p(s);
            continue;
        }

        int l = 0, r = s.size()-1;
        while (l <= r) {
            if (s[l] != s[r]) break;
            ans[l] = s[l];
            ans[r] = s[r];
            l++;
            r--;
            continue;
        }

        for (auto &c: ans) {
            if (c == '&') break;
            cout << c;
            c = '&';
        }

        string aux = "";

        fr(d, s.size()) {

            string auxx;
            int i = l;
            int j = r-d;
            if (j < i) break;
            int isp = 1;
            while (i < j) {
                if (s[i] != s[j]) {
                    isp = 0;
                    break;
                }
                i++;
                j--;
            }
            if (!isp) continue;
            for (i = l; i <= r-d; i++) auxx+=s[i];
            if (auxx.size() > aux.size()) aux = auxx;
        }

        fr(d, s.size()) {

            string auxx;
            int i = l+d;
            int j = r;
            if (j < i) break;
            int isp = 1;
            while (i < j) {
                if (s[i] != s[j]) {
                    isp = 0;
                    break;
                }
                i++;
                j--;
            }
            if (!isp) continue;
            for (i = l+d; i <= r; i++) auxx+=s[i];
            if (auxx.size() > aux.size()) aux = auxx;
        }

        if (aux.size()) cout << aux;

        for (auto c: ans)
            if (c != '&')
                cout << c;

        cout << endl;
    }
}