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 all substrings 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.
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”.
题目大意：
如果字符串里有重复出现的字母，就把它换成别的字母，保证字符串中每一个字母都不相同。问最少替换次数。所有字母均是小写字母。
解题思路：
长度超过26的字符串无解否则就是数他有多少重复的，一个小思维题。
代码如下：
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int n,book[27]={0};
cin>>n;
string s;
cin>>s;
if(n>26)cout<<-1<<endl;
else
{
int sum=0;
for(int i=0;i<s.size();i++)
{
int t=s[i]-'a';
book[t]++;
if(book[t]>1)sum++;
}
cout<<sum<<endl;
}
return 0;
}