codeforces 844A Diversity

本文介绍了一个简单的算法问题,即计算最少需要改变多少字符使得输入的字符串包含至少k种不同的字母,或者判断是否不可能实现这一目标。文章通过示例解释了问题,并提供了一段C++代码实现解决方案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

点击打开链接

A. Diversity
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Calculate the minimum number of characters you need to change in the string s, so that it contains at least k different letters, or print that it is impossible.

String s consists only of lowercase Latin letters, and it is allowed to change characters only to lowercase Latin letters too.

Input

First line of input contains string s, consisting only of lowercase Latin letters (1 ≤ |s| ≤ 1000|s| denotes the length of s).

Second line of input contains integer k (1 ≤ k ≤ 26).

Output

Print single line with a minimum number of necessary changes, or the word «impossible» (without quotes) if it is impossible.

Examples
input
yandex
6
output
0
input
yahoo
5
output
1
input
google
7
output
impossible
Note

In the first test case string contains 6 different letters, so we don't need to change anything.

In the second test case string contains 4 different letters: {'a', 'h', 'o', 'y'}. To get 5 different letters it is necessary to change one occurrence of 'o' to some letter, which doesn't occur in the string, for example, {'b'}.

In the third test case, it is impossible to make 7 different letters because the length of the string is 6.


水题

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
using namespace std;
int main()
{
    set<int>ff;
    char s[1010];
    int k;
    scanf("%s",s);
    scanf("%d",&k);
    int len=strlen(s);
    for(int i=0;i<len;i++)
    {
        ff.insert(s[i]);
    }
    if(len<k)
        printf("impossible\n");
    else
    {
        int w=ff.size();
        if(w>=k)
            printf("0\n");
        else
            printf("%d\n",k-w);
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值