PAT答案（到底買不買）

題目鏈接

https://www.nowcoder.com/pat/6/problem/4065

代碼

#include<iostream>
#include<string.h>
#define MAX 1005
using namespace std;

int main() {
    char a[MAX];
    char answer[MAX];
    int k = 0;
    scanf("%s%s", a,answer);
    for(int i=0; i<strlen(answer); i++) {
        for(int j=0; j<strlen(a); j++) {
            if(answer[i] == a[j]) {
                a[j] = ' ';
                k++;
                break;
            }
        }
    }
    if(k == strlen(answer)) printf("Yes %d\n", strlen(a)-k);
    else printf("No %d\n", strlen(answer)-k);
    return 0;
}