zoukankan      html  css  js  c++  java
  • 1092. 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'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.

    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
     1 #include<string>
     2 #include<iostream>
     3 #include<map>
     4 using namespace std;
     5 
     6 map<char,int> m1;
     7 int main()
     8 {
     9     string str1,str2;
    10     getline(cin,str1);
    11     getline(cin,str2);
    12     for(int i = 0 ;i < str1.length();++i)
    13     {
    14         ++m1[str1[i]];
    15     }
    16     bool is = 1;
    17     int cnt = 0;
    18     for(int i = 0 ;i < str2.length();++i)
    19     {
    20         if(m1[str2[i]] == 0)
    21         {
    22             is = 0;
    23             ++cnt;
    24         }
    25         else
    26         {
    27             --m1[str2[i]];
    28         }
    29     }
    30     
    31     if(!is)
    32     {
    33         cout << "No " << cnt <<endl;
    34     }
    35     else
    36     {
    37         for(map<char,int>::iterator it = m1.begin();it != m1.end();++it)
    38         {
    39             cnt += it->second;
    40         }
    41         cout << "Yes "<<cnt <<endl;
    42     }
    43     return 0;
    44 }
  • 相关阅读:
    WPF 如何创建自己的WPF自定义控件库
    浅谈WPF的VisualBrush
    从Oracle数据库中查询前几个月数据时需要注意的一些问题
    WPF当属性值改变时利用PropertyChanged事件来加载动画
    java array to list
    nGrinder 简易使用教程
    页面json 格式化+颜色高亮
    通过maven test 报org.apache.ibatis.binding.BindingException: Invalid bound statement
    jenkins 多选框
    jstack jstat 简易使用教程
  • 原文地址:https://www.cnblogs.com/xiaoyesoso/p/5210937.html
Copyright © 2011-2022 走看看