AIM Tech Round 4 (Div. 2) A. Diversity
2017-08-25 07:52
411 查看
题目大意
改变最小元素个数是总种类数大于K。题解
贪心选就行了。注意特判。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int read() { char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); while(ch>='0'&&ch<='9') {f=f*10+(ch^48);ch=getchar();} return f; } char s[1005];bool vis[35]; int main() { scanf("%s",s+1); int k=read(),n=strlen(s+1); if(n<k) { puts("impossible"); return 0; } for(int i=1;i<=n;i++) { vis[s[i]-'a']=1; } int ans=0; for(int i=0;i<26;i++) { if(vis[i]) ans++; } if(ans>=k) { printf("0"); } else { printf("%d",k-ans); } }
相关文章推荐
- 【AIM Tech Round 4 (Div. 2) A】Diversity
- Codeforces AIM Tech Round 4 (Div. 2) A. Diversity
- codeforces AIM Tech Round 3 (Div. 2)
- AIM Tech Round 4 (Div. 2)
- AIM Tech Round (Div. 2)-A. Save Luke(数学题)
- AIM Tech Round 3 (Div. 2) B. Checkpoints
- AIM Tech Round 3 (Div. 2) A. Juicer
- 【Codeforces AIM Tech Round 4 (Div. 2) C】
- AIM Tech Round (Div. 2)-B. Making a String(贪心)
- AIM Tech Round (Div. 2) D. Array GCD(dp)
- AIM Tech Round (Div. 2) C. Graph and String
- Codeforces刷题之路——AIM Tech Round 3 (Div. 2) A. Juicer
- AIM Tech Round 3 (Div. 2)
- CF AIM Tech Round 3 (Div. 2) D - Recover the String
- AIM Tech Round (Div. 1) B. Array GCD(数论+dp)
- AIM Tech Round 4 (Div. 2) B. Rectangles
- AIM Tech Round 4 (Div. 2)
- AIM Tech Round 3 (Div. 1) B. Recover the String 构造
- AIM Tech Round 3 (Div. 1)-C. Centroids
- AIM Tech Round 3 (Div. 2) A , B , C