# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40060 | 5ak0 | Torrent (COI16_torrent) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
ID: 5ak0
PROG:
LANG: C++11
*/
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7;
string s;
int ans;
int calc(string s1){
int res = 0;
for (int i = 0; i < s1.size(); ++i){
string kek1 = "";
for (int j = i; j < s1.size(); ++j){
kek1 += s1[j], kek2 = kek1;
reverse(kek2.begin(), kek2.end());
res += (kek1 == kek2);
}
}
return res;
}
int main(){
cin >> s;
ans = calc(s);
for (int i = 0; i < s.size(); ++i){
char ch = s[i];
for (char j = 'a'; j <= 'z'; ++j){
s[i] = j;
ans = max(ans, calc(s));
}
s[i] = ch;
}
cout << ans;
return 0;
}