QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#670990#5422. Perfect Palindromehansue#AC ✓12ms4008kbC++20620b2024-10-24 09:42:372024-10-24 09:42:38

Judging History

你现在查看的是最新测评结果

  • [2024-10-24 09:42:38]
  • 评测
  • 测评结果:AC
  • 用时:12ms
  • 内存:4008kb
  • [2024-10-24 09:42:37]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
string s;
int cnt[30];
void solve(){
	memset(cnt,0,sizeof(cnt));
	cin>>s;
	if(s.size()==1){
		printf("0\n");
		return;
	}
	for(int i=0;i<s.size();++i)
		cnt[s[i]-'a']++;
	char c;
	int tmp=0;
	for(int i=0;i<26;++i){
		if(cnt[i]>tmp){
			tmp=cnt[i];
			c=(char)(i+'a');
		}
	}
	int res=(int)s.size()-tmp;
	printf("%d\n",res);
}
int main(){
//	freopen("data.in", "r", stdin);
//	freopen("data.out", "w", stdout);
	int T;
	cin>>T;
	while(T--){
		solve();
	}

	return 0;

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3756kb

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 12ms
memory: 4008kb

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