PAT甲级1092
2017-01-18 22:56
316 查看
1092. To Buy or Not to Buy (20)
时间限制100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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:
ppRYYGrrYBR2258 YrR8RrY
Sample Output 1:
Yes 8
Sample Input 2:
ppRYYGrrYB225 YrR8RrY
Sample 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; } else cout << "No " << len2 - count << endl; return 0; } /*考的就是散列*/
相关文章推荐
- 浙大PAT甲级 1092
- PAT(甲级)1092. To Buy or Not to Buy (20)
- PAT(甲级)1092
- 1107. Social Clusters (30)-PAT甲级真题
- 1082. Read Number in Chinese (25)-PAT甲级真题
- 浙大pat甲级 1024
- 1115. Counting Nodes in a BST (30)-PAT甲级真题(二叉树的遍历,dfs)
- 1065. A+B and C (64bit) (20) PAT 甲级
- 1059. Prime Factors (25)-PAT甲级真题(素数表的建立)
- *浙大PAT甲级 1051
- 浙大PAT甲级 1069
- 浙大PAT甲级 1080
- 浙大PAT甲级 1100
- 浙江大学PAT_甲级_1031. Hello World for U (20)
- 1033. To Fill or Not to Fill (25)-PAT甲级真题(贪心算法)
- PAT 甲级1027. Colors in Mars (20)
- PAT 甲级 1012. The Best Rank
- PAT(甲级)1027. Colors in Mars (20)
- PAT 甲级 1020. Tree Traversals
- 【PAT甲级】1009. Product of Polynomials (25)