1092. To Buy or Not to Buy
来源:互联网 发布:中国软件资讯网 编辑:程序博客网 时间:2024/05/01 10:27
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
就是检查第二个字符串中每个元素是不是都在第一个字符串都出现中,如果是都出现则,打印Yes ,Yes后面这个数据用第一个字符串的长度-第二个字符串的长度
如果有一些元素没有出现,则打印No,No后面的数据则是没有出现元素的个数!
#include<iostream>#include<stdio.h> #include<string>using namespace std;int main(){string boss, eva;cin>>boss>>eva;int len1 = boss.length();int len2 = eva.length();bool flag = true;//是不是买下 int count = 0;for(int i = 0; i < len2; i ++){bool isExit = false; for(int j = 0; j < len1; j ++){if(eva[i] == boss[j]){boss[j] = '@';count ++;isExit = true;break;}}if(!isExit)flag = false;}if(flag)printf("Yes %d\n", len1-len2);elseprintf("No %d\n", len2 - 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
- 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)
- hdu 4027(区间更新)
- 概率论:高斯/正态分布
- CodeForces 73C LionAge II
- sicily 1129. ISBN
- ubuntu自定义通知
- 1092. To Buy or Not to Buy
- JAVA中的数据存储(堆及堆栈)
- [C++]输入输出流
- sicily 1133. SPAM
- SQLiteOpenHelper类
- jquery修改a标签的href链接和文字
- 自定义布局的小demo
- 程序运行时需要加载的方法 -----
- Java集合对象的深度复制与普通复制