/**********************3stone**************************
FileName: PAT.B1039&A1092.到底买不买
Author:3stone
Time:2017/3/7
***********************3stone*************************/
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int mp[200];
int main(){
char str1[1010], str2[1010];
while(scanf("%s%s", str1, str2) != EOF){
int lack = 0; //缺量
for(int i = 0; i < 200; i++){
mp[i] = 0;
}
int len1 = strlen(str1);
int len2 = strlen(str2);
for(int i = 0; i < len1; i++){
mp[str1[i]]++;
}
for(int i = 0; i < len2; i ++){
if(mp[str2[i]] > 0)
mp[str2[i]]--;
else
lack++;
}
if(0 == lack)
printf("Yes %d\n", len1 - len2);
else
printf("No %d\n", lack);
}
return 0;
}
散列--PAT.B1039&A1092.到底买不买
最新推荐文章于 2021-03-07 11:34:45 发布