# Codeforces Round #352 (Div. 2)（B）思维

283人阅读 评论(0)

B. Different is Good
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different.

Kerem recently got a string s consisting of lowercase English letters. Since Kerem likes it when things are different, he wants allsubstrings of his string s to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string "aba" has substrings "" (empty substring), "a", "b", "a", "ab", "ba", "aba".

If string s has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.

Your task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the length of the string s.

The second line contains the string s of length n consisting of only lowercase English letters.

Output

If it's impossible to change the string s such that all its substring are distinct print -1. Otherwise print the minimum required number of changes.

Examples
input
2
aa

output
1

input
4
koko

output
2

input
5
murat

output
0

Note

In the first sample one of the possible solutions is to change the first character to 'b'.

In the second sample, one may change the first character to 'a' and second character to 'b', so the string becomes "abko".

import java.lang.*;
import java.util.Scanner;

public class Main {

public static void main(String[] args) {
// TODO 自动生成的方法存根
Scanner in = new Scanner(System.in);
String s = new String();
String n = new String();
n=in.nextLine();
s=in.nextLine();
//System.out.println(n+" "+s);
if(s.length()>26)
{
System.out.println(-1);
}
else
{
int cnt[] = new int[300];
for(int i=0;i<150;i++)
{
cnt[i]=0;
}
for(int i=0;i<s.length();i++)
{
cnt[s.charAt(i)]++;
}
int ans=0;
for(int i=0;i<150;i++)
{
if(cnt[i]>0)
{
ans+=(cnt[i]-1);
}
}
System.out.println(ans);
}
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：137568次
• 积分：5542
• 等级：
• 排名：第4739名
• 原创：417篇
• 转载：109篇
• 译文：0篇
• 评论：24条
Gayhub--同性交友
https://github.com/qq1367212627
评论排行
最新评论