题库练习 Diversity
← 上一题 下一题 →

A11114 | Diversity

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

输入格式

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$ ).

输出格式

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

输入输出样例

输入 #1
yandex
6
输出 #1
0
输入 #2
yahoo
5
输出 #2
1
输入 #3
google
7
输出 #3
impossible
C++ 编辑器
输入
输出