This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
vector<int> a(26), b(26);
int ans = 0;
for (int i = 0; i < n / 2; i++) {
a[s[i] - 'a']++;
b[s[n - i - 1] - 'a']++;
if (a == b) {
ans += 2;
}
}
ans += n % 2 != 0 || a != b;
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |