PAT 1092. To Buy or Not to Buy
来源:互联网 发布:java精简版 编辑:程序博客网 时间:2024/05/01 08:51
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思路:把每个字符出现的次数按ASCII码顺序统计到数组中,对比两个数组的差距即可#include <stdio.h>#include <string.h>char ch1[1010], ch2[1010];int list1[130], list2[130], ln1, ln2;int main(){while(scanf("%s", &ch1) != EOF){memset(list1, 0, sizeof(list1));memset(list2, 0, sizeof(list2));scanf("%s", &ch2);ln1 = strlen(ch1);ln2 = strlen(ch2);for(int i = 0; i < ln1; i++){list1[ch1[i]]++;}for(int i = 0; i < ln2; i++){list2[ch2[i]]++;}int cha = 0;for(int i = 0; i < 130; i++){if(list2[i] > list1[i]){cha += list2[i] - list1[i];}}if(cha > 0){printf("No %d\n", cha);}else{printf("Yes %d\n", ln1 - ln2);}}return 0;}
- PAT A 1092. To Buy or Not to Buy (20)
- PAT 1092. To Buy or Not to Buy
- 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)
- 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-A 1092. To Buy or Not to Buy
- PAT--1092. To Buy or Not to Buy
- 【PAT】1092. To Buy or Not to Buy
- PAT-A 1092. To Buy or Not to Buy (20)
- pat 1092. To Buy or Not to Buy
- PAT-A-1092. To Buy or Not to Buy (20)
- Pat(A) 1092. To Buy or Not to Buy (20)
- 1092.To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- 1092. To Buy or Not to Buy
- ubuntu上zedboard用qt
- JAVA hashCode() 和equals() 区别和作用
- 好记性不如烂笔头87-spring3学习(8)-IoC的理解和比喻
- Oracle数据闪回
- Suse中出错Access denied for user ''@'localhost' to&
- PAT 1092. To Buy or Not to Buy
- Java获取照片EXIF信息
- 使用FastJson解析Json数据
- 线程间通信
- Ubuntu12.04下svn的安装和使用
- jQuery可智能缓存响应数据的ajax调用插件
- 重新使gitignore起作用的方法(转载MARK)
- UVa 1636 - Headshot(概率)
- R 语言乱码问题