PAT 1092. To Buy or Not to Buy (20)
来源:互联网 发布:网店seo 编辑:程序博客网 时间:2024/05/01 15:50
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.
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
一道字符串处理问题,没什么坑。 代码如下:
#include <iostream>#include <string>#include <cstring>#include <map>using namespace std;int main(void){string raw,target;cin>>raw>>target;map<char,int> need;int sizeR=raw.size(),sizeT=target.size();int rem=sizeR-sizeT;for(int i=0;i<sizeT;i++){if(need.count(target[i])<=0)need[target[i]]=1;elseneed[target[i]]++;}for(int i=0;i<sizeR;i++){if(need.count(raw[i])>0 && need[raw[i]]>0)need[raw[i]]--;}int more=0;map<char,int>::iterator it;for(it=need.begin();it!=need.end();it++)more+=it->second;if(more>0)cout<<"No "<<more;elsecout<<"Yes "<<rem;}
- PAT A 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 (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 1092. To Buy or Not to Buy
- PAT 1092. To Buy or Not to Buy(STL)
- PAT-A 1092. To Buy or Not to Buy
- 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)
- iOS 不调用相机实现拍照和录制视频
- nagios-解决监控页面上的乱码
- Java 回调
- Unity 游戏开发技巧集锦之使用忍者飞镖创建粒子效果
- 第一课 OC最常用的数据类型
- PAT 1092. To Buy or Not to Buy (20)
- android两种签名
- 银河移动工作平台
- Java 文件或者文件夹的压缩和解压
- foxmail邮件只能显示邮件头,不能显示内容
- sudo源码分析(二)
- JVM指令集(指令码、助记符、功能描述) --- 逐渐更新
- 欢迎使用CSDN-markdown编辑器
- eclipse修改默认工作空间