PAT 1092. To Buy or Not to Buy (20)

题目地址： http://www.patest.cn/contests/pat-a-practise/1092

 1 #include<cstdio>

 2 #include<iostream>

 3 #include<cstring>

 4 

 5 using namespace std;

 6 

 7 const int MAXN = 2000;

 8 char s[MAXN];

 9 char t[MAXN];

10 int ans;

11 void solve() {

12         int slen = strlen(s);

13         int tlen = strlen(t);

14         int cnt[200];

15         int scnt = 0;

16         int tcnt = 0;

17         memset(cnt, 0, sizeof(cnt));

18         for (int i = 0; i < slen; ++i) {

19                 ++cnt[s[i]];

20         }

21         for (int i = 0; i < tlen; ++i) {

22                 if (cnt[t[i]]) {

23                         --cnt[t[i]];

24                 } else {

25                         ++tcnt;

26                 }

27         }

28         if (tcnt) {

29                 cout << "No " << tcnt << endl;

30         } else {

31                 cout << "Yes " << slen - tlen << endl;

32         }

33 }

34 

35 int main() {

36         while(cin >> s >> t) {

37                 solve();

38         }

39         return 0;

40 }