【PAT】B1039/A1092. To Buy or Not to Buy (20)

Author: CHEN, Yue

Organization: 浙江大学

Time Limit: 150 ms

Memory Limit: 64 MB

Code Size Limit: 16 KB

B1039/A1092. To Buy or Not to Buy (20)

Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is “Yes”, please tell her the number of extra beads she has to buy; or if the answer is “No”, please tell her the number of beads missing from the string.

For the sake of simplicity, let us use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.
 

Input Specification:

Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.

Output Specification:

For each test case, print your answer in one line. If the answer is “Yes”, then also output the number of extra beads Eva has to buy; or if the answer is “No”, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.

Sample Input 1:

ppRYYGrrYBR2258

YrR8RrY

Sample Output 1:

Yes 8

Sample Input 2:

ppRYYGrrYB225

YrR8RrY

Sample Output 1:

No 2

Code

//NKW 乙级练习题1029
#include <bits/stdc++.h>
using namespace std;
string have, want;
int ha[128],cnt = 0;
int main(){
	cin>>have>>want;
	for (int i = 0; i < have.size(); i++){
		ha[have[i]]++;    // 最大的‘z’对应的int值为122（<128）
	}
	for (int i = 0; i < want.size(); i++){
		if (ha[want[i]] != 0)
			ha[want[i]]--;
		else    cnt++;
	}
	if (!cnt)   printf("Yes %d\n", have.size() - want.size());
	else    printf("No %d\n", cnt);
	return 0;
}

Analysis

-第一行输入老板有的一串珠子，第二行输入Eva想要有的珠子。

-求老板给的珠子是否包含所有Eva想要有的珠子，如果有，判断多了几颗珠子；如果没有，判断缺几颗珠子。