#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
#include<stack>
using namespace std;
#define INF 100000000
#define min(a,b) a<b?a:b
#define maxsize 10001
int main()
{
int Count[maxsize]={0};
set<char> str1,str2,str3;
char s1[maxsize],s2[maxsize];
scanf("%s%s",s1,s2);
int sum1,sum2;
sum1=sum2=0;
int length1=strlen(s1);
int length2=strlen(s2);
int flag=0;
for(int j=0;j<length1;j++)
for(int i=0;i<length2;i++)
if(s1[j]==s2[i]&&!Count[i])
{
sum1++;
Count[i]++;
break;
}
if(sum1==length2)
printf("Yes %d\n",length1-length2);
else
printf("No %d\n",length2-sum1);
return 0;
}
PAT 1092. To Buy or Not to Buy (20)
最新推荐文章于 2023-07-18 16:55:33 发布