QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#465791 | #5422. Perfect Palindrome | JustJie | AC ✓ | 0ms | 3764kb | C++20 | 880b | 2024-07-07 09:34:46 | 2024-07-07 09:34:47 |
Judging History
answer
/***************************************************************************************************
* author : Jie Chen (4th Year CS)
* school : Rochester Institute of Technology
* created: 07.06.2024 21:30:27
****************************************************************************************************/
#include "bits/stdc++.h"
using namespace std;
using i64 = long long;
constexpr int A = 26;
void work(int tc) {
string s;
cin >> s;
int n = s.size();
int cnt[A] {};
for (auto c : s) {
cnt[c - 'a']++;
}
int ans = n;
for (int a = 0; a < A; a++) {
ans = min(ans, n - cnt[a]);
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
for (int t = 1; T--; t++) {
work(t);
}
}
// ~ Just Jie
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
11107 lfpbavjsm pdtlkfwn fmb hptdswsoul bhyjhp pscfliuqn nej nxolzbd z clzb zqomviosz u ek vco oymonrq rjd ktsqti mdcvserv x birnpfu gsgk ftchwlm bzqgar ovj nsgiegk dbolme nvr rpsc fprodu eqtidwto j qty o jknssmabwl qjfv wrd aa ejsf i npmmhkef dzvyon p zww dp ru qmwm sc wnnjyoepxo hc opvfepiko inuxx...
output:
8 7 2 8 4 8 2 6 0 3 7 0 1 2 5 2 4 6 0 6 2 6 5 2 5 5 2 3 5 6 0 2 0 8 3 2 0 3 0 6 5 0 1 1 1 2 1 8 1 7 5 3 4 4 1 8 5 5 8 8 6 3 0 2 3 2 1 5 0 0 9 3 3 4 8 4 0 4 2 6 6 0 8 7 4 3 9 3 4 2 5 8 8 8 6 1 4 4 2 7 2 8 6 4 4 8 7 8 4 9 3 8 0 7 7 2 6 0 0 5 4 0 7 5 4 2 1 6 7 5 2 4 4 7 3 3 2 5 4 8 5 0 3 5 1 2 3 0 4 7 ...
result:
ok 11107 numbers