QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #105947 | #5422. Perfect Palindrome | RabbieWjy# | AC ✓ | 10ms | 3744kb | C++14 | 420b | 2023-05-16 08:13:03 | 2023-05-16 08:13:04 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int t,n;
char s[1000010];
int cnt[30];
int main()
{
scanf("%d",&t);
while (t --)
{
scanf("%s",s + 1);
n = strlen(s + 1);
for (int i = 0;i < 26;i ++) cnt[i] = 0;
for (int i = 1;i <= n;i ++) cnt[s[i] - 'a'] ++;
int ans = 0;
for (int i = 0;i < 26;i ++) ans = max(ans,cnt[i]);
printf("%d\n",n - ans);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3744kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: 0
Accepted
time: 10ms
memory: 3660kb
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