QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #105948 | #5422. Perfect Palindrome | lichenghan# | AC ✓ | 7ms | 3600kb | C++14 | 402b | 2023-05-16 08:14:53 | 2023-05-16 08:14:57 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+100;
int n;
char a[N];
int cnt[26];
void solve( ){
scanf("%s",a+1);n=strlen(a+1);
memset(cnt,0,sizeof(cnt));
for(int i=1;i<=n;i++){
cnt[a[i]-'a']++;
}
int maxn=0;
for(int i=0;i<=25;i++){
maxn=max(maxn,cnt[i]);
}
printf("%d\n",n-maxn);
}
int main(){
int t;
scanf("%d",&t);
while(t--){
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3524kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: 0
Accepted
time: 7ms
memory: 3600kb
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