PAT-PAT (Advanced Level) Practise To Buy or Not to Buy(20) 【一星级】
来源:互联网 发布:淘宝双11过后生意差 编辑:程序博客网 时间:2024/05/18 01:48
题目链接:http://www.patest.cn/contests/pat-a-practise/1092
题面:
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
能否用a串凑出b串,可以输出Yes和多的珠子数,不可以输出No和少的珠子数。
代码:
#include <iostream>#include <cstdio>#include <algorithm>#include <queue>#include <cstring>#include <string>using namespace std;#define LL long long int cnt[150];int main(){int len1,len2,ans; string a,b; cin>>a>>b;memset(cnt,0,sizeof(cnt));len1=b.length();for(int i=0;i<len1;i++)cnt[b[i]]++;len2=a.length();ans=0;for(int i=0;i<len2;i++) //如果需要该珠子,需要数-1,并且未被替代珠子数减一 if(cnt[a[i]]) { cnt[a[i]]--; len1--; } //不需要,即为浪费 else ans++; //如果都能被替代 if(len1==0)cout<<"Yes "<<ans<<endl; //不能完全替代 else cout<<"No "<<len1<<endl; return 0;}
- PAT-PAT (Advanced Level) Practise To Buy or Not to Buy(20) 【一星级】
- PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
- 1092. To Buy or Not to Buy (20)【水题】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1092 To Buy or Not to Buy (20)
- 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(Advanced Level)Practice--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 (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)
- Android ActionBar应用实战,高仿微信主界面的设计
- JAVA中,comparator接口对数据进行排序
- 一维数组解决01背包问题
- Android开发 Android手势
- Python Gui 学习 Tkinter
- PAT-PAT (Advanced Level) Practise To Buy or Not to Buy(20) 【一星级】
- 2.2.3 Conies and dual conies
- scala学习-介绍scala的几种特性6
- 1. Spring 4.2.3前瞻-更简单的Application Event
- Back Propagation in BPNeuralNetwork
- HDU 1584 蜘蛛牌 (区间DP)
- java虚拟机管理的内存
- python爬图片
- 基数排序