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

来源:互联网 发布:aws s3 上传文件 js 编辑:程序博客网 时间:2024/05/01 19:49
#include<stdio.h>#include<string.h>#include<map>#define SIZE 1005using namespace std;char sell[SIZE], want[SIZE];map<char, int>m;int main(){    freopen("1.in", "r", stdin);    scanf("%s", sell);    scanf("%s", want);    int i;    for (i = 0; i < strlen(want); i++)        m[want[i]]++;    for (i = 0; i < strlen(sell); i++)        if (m[sell[i]]>0)            m[sell[i]]--;    map<char, int>::iterator it;    int count = 0;    for (it = m.begin(); it != m.end(); it++)        if (it->second>0)            count += it->second;    if (count == 0)        printf("Yes %d\n", strlen(sell) - strlen(want));    else printf("No %d\n", count);    return 0;}
0 0
原创粉丝点击