codeforce_844A
2018-04-03 01:46
267 查看
Diversity
Time Limit: 1000msMemory Limit: 262144KB This problem will be judged on CodeForces. Original ID: 844A
64-bit integer IO format: %I64d Java class name: (Any)
Prev Submit Status Statistics Next
Type:
None
Tag it!
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.
Sample Input
Input
yandex
6
Output
0
Input
yahoo
5
Output
1
Input
google
7
Output
impossible
Hint
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.
Source
AIM Tech Round 4 (Div. 2)
mean 看案例就能看懂把
Time Limit: 1000msMemory Limit: 262144KB This problem will be judged on CodeForces. Original ID: 844A
64-bit integer IO format: %I64d Java class name: (Any)
Prev Submit Status Statistics Next
Type:
None
Tag it!
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.
Sample Input
Input
yandex
6
Output
0
Input
yahoo
5
Output
1
Input
7
Output
impossible
Hint
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.
Source
AIM Tech Round 4 (Div. 2)
mean 看案例就能看懂把
#include<bits/stdc++.h> using namespace std; const int mm=1e9; int main() { char s[1111]; int n,i,j; while(cin>>s>>n) { int len=strlen(s); set<char> st; int cnt=0; for(i=0;i<len;i++) { if(st.find(s[i])==st.end()) st.insert(s[i]); else cnt++; } int ans=st.size()+cnt; if(ans>=26) ans=26; if(ans<n) puts("impossible"); else { if(n>st.size()) cout<<n-st.size()<<endl; else puts("0"); } } }
相关文章推荐
- Codeforce Gym 100015I Identity Checker 暴力
- Codeforce 527D Clique Problem题解
- codeforce 766D Mahmoud and a Dictionary 带权并查集
- codeforce 298 B Sail
- codeforce #126Div2 200A Cinema 【优化暴力枚举】
- codeforce #387 D. Winter Is Coming
- codeforce 621A(水题)
- codeforce Gym 100203I I WIN (网络流)
- codeforce-B. Sort the Array
- CodeForce#191 Div2
- Codeforce 327D 二分
- codeforce 793 B Igor and his way to work
- Codeforce 633D multiset
- Codeforce - 262 - B. Roma and Changing Signs
- 【打渔】CodeForce Round 197 Div.2 Problem_A
- Codeforce Gym 100819L : 2015-2016 ACM-ICPC Pacific Northwest Regional Contest - L 这是一道阅读理解(微笑)
- Code Force 21B Intersection
- codeforce 149D Coloring Brackets (区间DP)
- DFS J. Cleaner Robot Codeforce 589J(实例与分析)
- codeforce 776 D The Door Problem(DFS遍历)