PAT A 1092. To Buy or Not to Buy (20)
来源:互联网 发布:明道软件如何 编辑:程序博客网 时间:2024/05/01 20:54
题目
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.
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:
ppRYYGrrYBR2258YrR8RrY
Sample Output 1:
Yes 8
Sample Input 2:
ppRYYGrrYB225YrR8RrY
Sample Output 1:
No 2
没啥好说的,直接统计输出一下即可
代码:
#include <iostream>#include <algorithm>#include <string>using namespace std;int main(){string s1,s2;//两个串cin>>s1>>s2;int count1[256]={0},count2[256]={0};//各个串中各个字符的数量int miss=0,extra=0;//缺失数和多买的数for(int i=0;i<s1.size();i++)count1[s1[i]]++;for(int i=0;i<s2.size();i++)count2[s2[i]]++;for(int i=0;i<256;i++){if(count1[i]>=count2[i])extra+=count1[i]-count2[i];elsemiss+=count2[i]-count1[i];}if(miss!=0)cout<<"No "<<miss;elsecout<<"Yes "<<extra;return 0;}
- PAT A 1092. To Buy or Not to Buy (20)
- PAT-A 1092. To Buy or Not to Buy (20)
- PAT-A-1092. To Buy or Not to Buy (20)
- Pat(A) 1092. To Buy or Not to Buy (20)
- PAT-A 1092. To Buy or Not to Buy
- PAT 1092. To Buy or Not to Buy (20)
- pat 1092. To Buy or Not to Buy (20)
- PAT 1092. To Buy or Not to Buy (20)
- 【PAT】1092. To Buy or Not to Buy (20)
- PAT 1092. To Buy or Not to Buy (20)
- PAT 1092. To Buy or Not to Buy
- PAT 1092. To Buy or Not to Buy(STL)
- PAT--1092. To Buy or Not to Buy
- 【PAT】1092. To Buy or Not to Buy
- pat 1092. To Buy or Not to Buy
- PAT A1092. To Buy or Not to Buy (20)
- PAT A1092. To Buy or Not to Buy (20)
- PAT A1092. To Buy or Not to Buy (20)
- 说说大型高并发高负载网站的系统架构(更新)
- Android图片滚动,加入自动播放功能,使用自定义属性实现,霸气十足!
- ETL架构中的38个子系统
- 缩小窗口时CSS背景图出现右侧空白BUG的解决方法
- java基础day01
- PAT A 1092. To Buy or Not to Buy (20)
- oracle忘记管理员密码?创建新用户,赋予管理员权限
- 高安全性操作系统的设计
- CSDN-markdown语法之如何使用LaTeX语法编写数学公式
- [Leetcode] Maximum Product Subarray
- 啊为噶
- css (overflow属性)
- C#和JAVA的相同点和不同点
- 博客一直审核什么原因呢?