PAT甲级1092
来源:互联网 发布:知水牌富氢水杯的价格 编辑:程序博客网 时间:2024/06/07 06:43
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<cstdio>#include<iostream>#include<string.h>#include<string>#include<vector>#include<algorithm>using namespace std;int main(){string s1, s2;cin >> s1 >> s2;int len1 = s1.size();bool *hashtable1 = new bool[len1];fill(hashtable1, hashtable1 + len1, false);int len2 = s2.size(); int count = 0;for (int i = 0; i < len2; i++){for (int j = 0; j < len1; j++){if (s1[j] == s2[i]){if (!hashtable1[j]){hashtable1[j] = true;count++;break;}}}}if (len2 == count){cout << "Yes " << len1 - count << endl;}elsecout << "No " << len2 - count << endl;return 0;}/*考的就是散列*/
- PAT(甲级)1092
- 浙大PAT甲级 1092
- PAT甲级1092
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- 触摸事件分发源码分析(十)
- 18.玩转Spring Boot 注册Servlet、Filter、Listener
- C++对按钮的操作。。急.............
- BZOJ 1024 生日快乐 搜索 DFS
- JZOJ4956. 【WC模拟】Arrangement
- PAT甲级1092
- C语言——系统函数和库函数的区别
- hdu2504 又见GCD 数论
- 文件复制代码
- Spark源码学习(一)---Spark的启动脚本
- shell 定时备份mysql
- linux下redis设置开机自启动
- IO流_File类的创建功能
- Failed to load resource: the server responded with a status of 406 (Not Acceptable)问题的解决方案