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’s 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.
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.
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.
- 遍历结束后，当less <0 的时候，说明珠子不够，那么要输出no和珠子数量
- 输出Yes 和多余的珠子数量
- offer 是提供的串的Counter
- want 是想要的串的Counter
- more 是多出来的珠子数量
- less 是不够的珠子数量
- 因为使用Python3 能AC，因此只放了Python的题解。
from collections import Counter