A1092 To Buy or Not to Buy (20 分)

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 1010;
int change(char c)
{
    //0-9 a-z A-Z
    if(c>='0' && c<='9')
        return c - '0';
    else if(c >= 'a' && c <= 'z')
        return c - 'a' + 10;
    else if(c >= 'A' && c <= 'Z')
        return c - 'A' + 36;
}

int main()
{
    char First[maxn],Second[maxn];
    int hashTable[85] = {0};
    scanf("%s",First);
    getchar();
    scanf("%s",Second);
    int len1,len2,miss=0;
    len1 = strlen(First);
    len2 = strlen(Second);
    
    for(int i=0;i<len1;i++)
    {
        int temp = change(First[i]);
        hashTable[temp]++;
    }
    
    for(int i=0;i<len2;i++)
    {
        int temp = change(Second[i]);
        hashTable[temp]--;
        if(hashTable[temp]<0)
            miss++;
    }
    
    if(miss>0)
        printf("No %d\n",miss);
    else
        printf("Yes %d\n",len1-len2);
    return 0;
}