QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#153532#5422. Perfect PalindromeaqxaAC ✓2ms4016kbC++20485b2023-08-30 10:15:422023-08-30 10:15:42

Judging History

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

  • [2023-08-30 10:15:42]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:4016kb
  • [2023-08-30 10:15:42]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std; 

using ll = long long; 

void solve() {
    string s; 
    cin >> s; 
    int n = s.size(); 
    
    vector<int> f(26, 0); 
    for (char x: s) {
        f[(int)(x - 'a')]++; 
    }

    cout << n - *max_element(f.begin(), f.end()) << "\n";
  
}

int32_t main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0); 

    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: 2ms
memory: 3624kb

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 1ms
memory: 4016kb

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