QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#275991#5422. Perfect PalindromeLiLIAC ✓154ms53384kbJava111.4kb2023-12-05 13:49:272023-12-05 13:49:27

Judging History

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

  • [2023-12-05 13:49:27]
  • 评测
  • 测评结果:AC
  • 用时:154ms
  • 内存:53384kb
  • [2023-12-05 13:49:27]
  • 提交

answer


import java.util.*;

import java.io.*;
import java.math.*;	
public class Main {
	
	static BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter pw=new PrintWriter(new OutputStreamWriter(System.out));
	static StringTokenizer tokenizer=new StringTokenizer("");
	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens()) {
	         tokenizer = new StringTokenizer(reader.readLine());
	        }
	        return tokenizer.nextToken();
	    }
    static int nextInt() throws IOException
	    {
	        return Integer.parseInt(next());
	    }
	    static double nextDouble() throws IOException
	    {
	        return Double.parseDouble(next());
	    }
	    static long nextLong() throws IOException
	    {
	        return Long.parseLong(next());
	    }
	    static int[]a=new int[26];//a的97
		public static void main(String[] agrs) throws IOException {
			int t=nextInt();
			ArrayList<Integer>ans=new ArrayList<>();
			while(t-->0)
			{
				String s=next();
				for(int i=0;i<s.length();i++)
				{
					a[(s.charAt(i)-97)]++;
				}
				int max=0;
				for(int i=0;i<a.length;i++)
				{
					max=Math.max(max, a[i]);
				}
				ans.add(s.length()-max);
				for(int i=0;i<a.length;i++)
				{
					a[i]=0;
				}
			}
		
			for(int K:ans)
			{
				pw.println(K);
			}
			pw.close();
	}	
}
	

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 46ms
memory: 47684kb

input:

2
abcb
xxx

output:

2
0

result:

ok 2 number(s): "2 0"

Test #2:

score: 0
Accepted
time: 154ms
memory: 53384kb

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