1092. To Buy or Not to Buy (20)
来源:互联网 发布:移动网络的账号和密码 编辑:程序博客网 时间:2024/05/01 14:55
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<vector>#include<algorithm>#include<queue>#include<stack>#include<string>#include<string.h>using namespace std;int main(){ freopen("F://Temp/input.txt", "r", stdin); string boss; string Eva; cin >> boss >> Eva; int colors_boss[128]; int colors_eva[128]; memset(colors_eva, 0, sizeof(colors_eva)); memset(colors_boss, 0, sizeof(colors_boss)); for (int i = 0; i < Eva.size(); ++i){ ++colors_eva[int(Eva[i])]; } for (int i = 0; i < boss.size(); ++i){ ++colors_boss[int(boss[i])];// } int negative = 0, positive = 0; for (int i = 0; i < 128; ++i){ if (colors_eva[i] <= colors_boss[i]) positive += colors_boss[i] - colors_eva[i];// else negative += colors_eva[i] - colors_boss[i]; } if (negative > 0) cout << "No " << negative << endl; else cout << "Yes " << positive << endl; 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
- 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 (20)
- PAT 1092. To Buy or Not to Buy (20)
- pat 1092. To Buy or Not to Buy (20)
- 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)
- 【PAT】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)
- 1092. To Buy or Not to Buy (20)
- iOS 用Runtime解决服务器返回NSNull问题
- 在伙伴算法之前的内存管理机制
- Linux磁盘与目录的容量
- java 集合
- iOS应用性能调优的25个建议和技巧
- 1092. To Buy or Not to Buy (20)
- MySQL查询缓存
- Java多线程生命周期
- 第一天的学习情况
- maven是什么?
- 统计一字符串中个数最多的字符
- java String类分析
- iOS基础知识:Objective-C 之 JSON&XML
- leetcode: (206) Reverse Linked List