CodeForces - 672B Different is Good (模拟)水
来源:互联网 发布:淘宝店铺图片多大尺寸 编辑:程序博客网 时间:2024/06/09 13:09
Description
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 strings.
The second line contains the string s of lengthn 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.
Sample Input
2aa
1
4koko
2
5murat
0
Sample Output
Hint
Source
#include<stdio.h>#include<math.h>#include<string.h>#include<algorithm>#define N 100010using namespace std;char s[N];int vis[200];int main(){int n,cnt,i,j;while(scanf("%d",&n)!=EOF){memset(vis,0,sizeof(vis));cnt=0;scanf("%s",s);if(n>26)printf("-1\n");else{for(i=0;i<strlen(s);i++){if(vis[s[i]])cnt++;elsevis[s[i]]=1;}printf("%d\n",cnt);}}return 0;}
- CodeForces - 672B Different is Good (模拟)水
- CodeForces 672B Different is Good
- CodeForces-672B-Different is Good
- CodeForces 672B Different is Good
- [CodeForces]-672B-Different is Good
- Codeforces 672B Different is Good【水题】
- CodeForces 672B Different is Good(和而不同)
- Codeforces Round #352 (Div. 2)-B. Different is Good(模拟)
- B. Different is Good
- Codeforces Round #352 (Div. 2) B. Different is Good
- Codeforces Round #352 (Div. 2) B. Different is Good __ substrings water problem
- Codeforces 264B Good Sequences (dp)
- CodeForces - 141B Hopscotch (模拟)水
- CodeForces 754B(模拟)
- codeforces 839B(模拟)
- Codeforces 264B (Good Sequences)
- codeforces Good Bye 2015 B
- Good Sequences(codeforces 264B)
- 结构体大小的计算,对齐
- 合并两个有序链表(递归非递归方法)
- IOS开发-画饼图画柱状图
- BZOJ 4524: [Cqoi2016]伪光滑数
- Controller取得ajax传递的json
- CodeForces - 672B Different is Good (模拟)水
- 7.spark Streaming 技术内幕 : 从DSteam到RDD全过程解析
- 【Android学习札记】数据类型
- Laravel框架-搭建
- POJ3660 Cow Contest (传递闭包)
- Android Monkey的用法
- 快捷启动软件的软件——Launchy
- Linux的sed命令
- linux改变带锁文件 和 改变访问权限