1092. To Buy or Not to Buy (20)
来源:互联网 发布:硬盘数据恢复最好软件 编辑:程序博客网 时间:2024/05/01 15:01
1092. To Buy or Not to Buy (20)
时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueEva 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第一串商店的
第二串要买的
问如果买商店的这出串,是否满足要买的颜色和对应的个数:满足,Yes,并给出多买个个数
不满足,No,并给出还差几颗
统计个数的时候是某【颜色需要的个数】和【商店提供的这个颜色个数】取最小
评测结果
时间 结果 得分 题目 语言 用时(ms) 内存(kB) 用户 8月19日 08:56答案正确201092C++ (g++ 4.7.2)1436datrilla测试点
测试点 结果 用时(ms) 内存(kB) 得分/满分 0答案正确11806/61答案正确13086/62答案正确11806/63答案正确13081/14答案正确14361/1
#include<iostream> #include<string> using namespace std; void countnum(int *c, string a){ int index = 0; while (a[index]!='\0') { if (isdigit(a[index])) c[a[index] - '0']++; else if (isupper(a[index])) c[a[index] - 'A' + 36]++; else c[a[index] - 'a' + 10]++; index++; }}int main(){ string shop, eva; int count[2][63] = {0}; getline(cin, shop); getline(cin, eva); countnum(count[0],eva); countnum(count[1],shop); int goal = 0; int index = 0; while (index < 63) { if (count[0][index] != 0 ) goal += count[0][index] <= count[1][index] ? count[0][index] : count[1][index]; index++; } if (goal < eva.size()) cout << "No " << eva.size() - goal << endl; else cout << "Yes " << shop.size() - goal << endl; system("pause"); 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)
- hdu5399
- 马尔可夫链及吉布斯抽样 入门详解(Markov Chain Monte Carlo and Gibbs Sampling)
- Docker —— 从入门到实践
- LeetCode Binary Tree Preorder Traversal
- 《系统工程手册》中提及的Expert Choice软件
- 1092. To Buy or Not to Buy (20)
- socket client
- win10的升级方法
- 排序算法小结
- HDU 5400 Arithmetic Sequence(2015 Multi-University Training Contest 9 2015多校联合)
- 关于ListActivity的使用和SimpleAdapter的使用
- TextView代码setTextColor无效
- 编写一个程序把8个整数读入一个数组,然后以相反的顺序打印他们
- python装饰器实现单例模式