Codeforces AIM Tech Round 4 (Div. 2) A Diversity

这题居然被hack了,可以说是非常难受了.

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <math.h>
#include <string>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
const int MAXN = 1e5+17;
const int MAXM = 20;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    string str;
    cin>>str;
    map<int,int > mp;
    int have = 0;
    for (int i = 0; i < str.size(); ++i)
    {
        if(mp[str[i]]==0)
            have++;
        mp[str[i]]++;
    }
    int k;
    cin>>k;
    if(str.size()>=k)
    {
        if(have>=k)
            cout<<0<<endl;
        else
            cout<<k-have<<endl;
    }
    else
        cout<<"impossible"<<endl;
    return 0;
}