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.

    figbuy.jpg

    Figure 1

    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 2:

    No 2

    数一数串中的字母

    #include <iostream>
    #include <unordered_map>
    using namespace std;
    int main(){
        string A, B;
        unordered_map<char, int> m;
        int lost = 0;
        getline(cin, A);
        getline(cin, B);
        for(int i = 0; i < A.length(); i++)
            m[A[i]]++;
        for(int i = 0; i < B.length(); i++)
            if(m[B[i]] > 0) m[B[i]]--;
            else lost++;
        if(lost != 0) cout << "No " << lost;
        else cout << "Yes " << A.length() - B.length();
        return 0;
    }
  • 相关阅读:
    20155339 Exp9 Web安全基础
    20155339 Exp8 Web基础
    20155339 Exp7 网络欺诈防范
    20155339 Exp6 信息搜集与漏洞扫描
    20155339 Exp5 MSF基础应用
    20155339 Exp4 恶意代码分析
    20155339 Exp3 免杀原理与实践
    20155339平措卓玛 Exp2 后门原理与实践
    20155339平措卓玛 Exp1 PC平台逆向破解(5)M
    20155339 第16周课堂实践加分作业
  • 原文地址:https://www.cnblogs.com/littlepage/p/12910263.html
Copyright © 2011-2022 走看看