zoukankan      html  css  js  c++  java
  • Codeforces Round #352 (Div. 2) B

    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
    先排序,用总长度减去变化的量即可
    #include<iostream>
    #include<cstring> 
    #include<algorithm>
    using namespace std;
    int a,cnt=0,n;
    char b[100000];
    int main()
    {
        cin>>n;
        cin>>b;
        int len=strlen(b);
        sort(b,b+len);
        if(len>26)
            cout<<-1<<endl;
        else
        {
                for(int i=0;i<len;i++)
        {
            if(b[i]!=b[i+1])
                cnt++;
        }
        cout<<len-cnt<<endl;
        }
  • 相关阅读:
    八皇后 c++
    筛法求素数
    3月13号周练——2015 Multi-University Training Contest 9
    Mac搭建Git服务器—开启SSH
    push自定义动画
    学习:二维码、QR码、J4L-QRCode、java
    Java注解Annotation详解
    IOS 基于APNS消息推送原理与实现(JAVA后台)
    IOS学习笔记—苹果推送机制APNs
    linux yum命令详解
  • 原文地址:https://www.cnblogs.com/wangmenghan/p/5491783.html
Copyright © 2011-2022 走看看