1092. To Buy or Not to Buy (20)
来源:互联网 发布:阿里云服务器怎么租用 编辑:程序博客网 时间:2024/05/01 08:12
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:ppRYYGrrYBR2258YrR8RrYSample Output 1:
Yes 8Sample Input 2:
ppRYYGrrYB225YrR8RrYSample Output 1:
No 2
//1092#include<iostream>#include<string>using namespace std;int main(){string shop,eva;cin>>shop>>eva;int s[265]={0};//count the shop's beadsint e[265]={0};//count Eva's beadsfor(int i=0;i<shop.size();++i)++s[shop[i]];for(int i=0;i<eva.size();++i)++e[eva[i]];int count=0;//the number of missing beadsfor(int i=0;i<256;++i)if(s[i]<e[i])count+=e[i]-s[i];if(count==0)cout<<"Yes "<<shop.size()-eva.size();elsecout<<"No "<<count;return 0;}
- 1092.To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy (20)
- PAT A 1092. To Buy or Not to Buy (20)
- 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)
- 1092. To Buy or Not to Buy (20)
- 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)
- 1092. To Buy or Not to Buy (20)
- PAT 1092. To Buy or Not to Buy (20)
- 1092. To Buy or Not to Buy (20)
- IOS UIView设置背景
- PHP流程控制语句
- Python读取非UTF-8编码文件出错的解决办法
- 通过nginx与fastcgi分离实现开发环境统一
- android开源库导入报错
- 1092. To Buy or Not to Buy (20)
- Android架构及开发技术
- ClassNotFoundException: NoHttpResponseException
- 踏上编程大道 从Python 开始成为神级Coder 吧
- ListView的监听器中OnItemClick各个参数的作用
- 在Linux上用wget把tail输出的东西提交到其它服务器上
- 5个经典的前端面试问题
- C# windows 逐行驱动打印
- 前端工程师应该具备的三种思维