Algorithm

B. Different is Good
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/672/B
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 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.

Examples
input
Copy
2
aa
output
Copy
1
input
Copy
4
koko
output
Copy
2
input
Copy
5
murat
output
Copy
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".

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <iostream>
#include <string>

using namespace std;

int main() {
	int t, c = 0;
	cin >> t;

	if (t > 26) {
		cout << -1 << endl;
		return 0;
	}

	string s;
	cin >> s;

	int arr[26] = { 0 };

	for (int i = 0; i < t; i++)
		arr[s[i] - 'a']++;

	for (int i = 0; i < 26; i++)
		if (arr[i] > 0)
			c += arr[i] - 1;

	cout << c << endl;

	return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2
aa

Output

x
–
+
cmd
1
Advertisements

Demonstration

Codeforces Solution-Different is Good-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+