1092. To Buy or Not to Buy
来源:互联网 发布:唐勇的seo分享平台 编辑:程序博客网 时间: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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
#define max1 100001
#define inf -1
int main()
{
vector<int>a(300,0);
string s1,s2;
cin>>s1>>s2;
for(int i=0;i<s1.length();i++)
{
a[s1[i]]++;
}
for(int i=0;i<s2.length();i++)
{
a[s2[i]]--;
}
int count1=0,count2=0,flag=0;
for(int i=0;i<300;i++)
{
if(a[i]<0)
{
flag=1;
count2+=a[i];
}
if(a[i]>0)
count1+=a[i];
}
if(flag)
cout<<"No"<<' '<<-count2;
else
cout<<"Yes"<<' '<<count1;
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
- 1004. To Buy or Not to Buy
- 1004. To Buy or Not to Buy
- 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
- 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(STL)
- 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)
- 【BZOJ 1046】【HAOI 2007】上升序列
- mysql 5.5多实例部署
- Java Web会话机制,Cookie和Session详解
- C# 树状视图
- C++文件流对象的学习及其windows磁盘文件路径的写法“/”
- 1092. To Buy or Not to Buy
- HTTP,HTTP2.0,SPDY,HTTPS区别
- 甲骨文预科学习第二次
- Oracle CDC说明及实施
- 【GMT5】用gmtselect命令筛选数据
- Java 征途:行者的地图
- 团战可以输、提莫必须死
- 1093. Count PAT's
- Python GUI进阶(ttk)—让界面变得更美