PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
来源:互联网 发布:拓扑学 网络课程 编辑:程序博客网 时间:2024/06/08 11:10
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<vector>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1e5 + 10;char s[maxn];int cnt[maxn], a, b, ans;int main(){scanf("%s", s);a = strlen(s);for (int i = 0; s[i]; i++) cnt[s[i]]++;scanf("%s", s);b = strlen(s);for (int i = 0; s[i]; i++){if (cnt[s[i]]) cnt[s[i]]--;else ans++;}if (ans) printf("No %d\n", ans);else printf("Yes %d\n", a - b);return 0;}
- PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
- PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
- PAT-PAT (Advanced Level) Practise To Buy or Not to Buy(20) 【一星级】
- 1092. To Buy or Not to Buy (20)【水题】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1092(To Buy or Not to Buy)
- PAT (Advanced Level) 1092. To Buy or Not to Buy (20) 哈希
- 【PAT】【Advanced Level】1092. To Buy or Not to Buy (20)
- PAT (Top Level) Practise 1004To Buy or Not to Buy - Hard Version (35)
- 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 A1092. 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 A1092. To Buy or Not to Buy (20)
- Python中对字典排序
- 64.获取键盘通知的 UserInfo
- 将基本数据类型值作为对象处理
- jpa 里用的分页实现类org.springframework.data.domain.PageImpl<T>
- 【BZOJ1922】【Tyvj1736】【codevs2129】大陆争霸,无语最短路
- PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
- 玩转Flume+Kafka原来也就那点事儿
- [Java] 实验5参考代码
- Spring事务配置的五种方式
- 歌词滚动显示
- setCompoundDrawables与setCompoundDrawablesWithIntrinsicBounds的区别
- jpa 的分页类org.springframework.data.domain.Page<T>
- POJ 2299 Ultra-QuickSort(逆序对数,线段树/树状数组/归并排序)
- Maven详解之仓库------本地仓库、远程仓库