到底买不买（20）

#include <iostream>
#include <cstring>
using namespace std;

int main(){
    int hash[128]={0};
    char a[1010],b[1010];
    cin>>a>>b;
    int len1=strlen(a);
    int len2=strlen(b);
    for(int i=0;i<len1;i++)
        hash[a[i]]++;
    int num=0;
    for(int i=0;i<len2;i++){
        if(hash[b[i]]>0){
            hash[b[i]]--;
            num++;
        }
    }
    if(num==len2) cout<<"Yes"<<" "<<len1-num<<'\n';
    else cout<<"No"<<" "<<len2-num<<'\n';

    return 0;
}

一点点在线处理

#include <stdio.h>
int main(){
 char A[123] = {0}, B[123] = {0}, i, rest = 0, count_A = 0, count_B = 0, ch;
 while ((ch = getchar()) != '\n')
  A[ch]++,count_A++;
 while ((ch = getchar()) != '\n')
  B[ch]++,count_B++;
 for (i = 1; i < 123; i++)
  if (B[i] != 0)
   rest += (A[i] >= B[i] ? 0 : B[i] - A[i]);
 if (rest != 0)
  printf("No %d", rest);
 else
  printf("Yes %d", count_A - count_B);
}

public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String oldStr = sc.nextLine();
        String needStr = sc.nextLine();

        Map<Character,Integer> map = new HashMap<>();
        char[] chars = oldStr.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            if (map.containsKey(chars[i])){
                int count = map.get(chars[i]);
                map.put(chars[i],count+1);
            }else {
                map.put(chars[i],1);
            }
        }

        char[] needChars = needStr.toCharArray();
        int lastCount = 0;
        for (int i = 0; i < needChars.length; i++) {
            if (map.containsKey(needChars[i])){
                if (map.get(needChars[i])>0){
                    int count = map.get(needChars[i]);
                    map.put(needChars[i],count-1);
                }else {
                    lastCount++;
                }
            }else {

                lastCount++;
            }
        }

        if (lastCount==0){
            System.out.println("Yes "+(oldStr.length()-needStr.length()));
        }else {
            System.out.println("No "+lastCount);
        }

    }

#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
unordered_map<char,int> book;
int main(){
    ios::sync_with_stdio(false);
    string s1,s2;
    cin>>s1>>s2;
    int extra = 0,flag = 0;
    for(char c : s1) book[c]++;
    for(char c : s2){
        if(book[c]>0) book[c]--;
        else extra++,flag = 1;
    }
    flag ? cout<<"No "<<extra<<endl:cout<<"Yes "<<s1.length()-s2.length()<<endl;
    return 0;
}

import java.util.*;
 
publicclassMain{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String str1 = sc.next();
            String str2 = sc.next();
            LinkedList<Character> list = new LinkedList<Character>();
            for(inti = 0; i < str1.length(); i++){
                charch = str1.charAt(i);
                list.add(ch);
            }
            int count = 0;
            for(inti = 0; i < str2.length(); i++){
                charch = str2.charAt(i);
                for(intj = 0; j < list.size(); j++){
                    if(ch == list.get(j)){
                        list.remove(j);
                        count++;
                        break;
                    }
                }
            }
            if(count == str2.length())
                System.out.println("Yes "+ (str1.length()-count));
            else
                System.out.println("No "+ (str2.length()-count));
        }
        sc.close();
    }   
}

#计算想要的珠子集合里，想要的和已有的数量谁多，想要的多的话就是缺失
#有缺失输出No，否则输出Yes
try:
    while True:
        have = input()
        want = input()
        lost = 0
        for i in set(want):
            if have.count(i) < want.count(i):
                lost += want.count(i)-have.count(i)
        if lost:
            print('No %d'%lost)
        else:
            print('Yes %d'%(len(have)-len(want)))

except Exception:
    pass

超短
#include<bits/stdc++.h>
#define maxn 1000
using namespace std;
int main(){
    char a[maxn],b[maxn];
    int count=0,need[128]={0};
    scanf("%s%s",&a,&b);
    for(int i=0;i<strlen(a);need[a[i++]]++);
    for(int j=0;j<strlen(b);need[b[j]]--,need[b[j]]<0?count++,j++:j++);
    (count>0)?printf("No %d",count):printf("Yes");
}

#include<stdio.h>
#include<string.h>
int main (){//the shorter,the better.
    int hash[128],i,l[2];char need[1000],sell[1000];
    for(;~scanf("%s %s",sell,need);printf(l[1]>0?"No %d\n":"Yes %d\n",l[l[1]>0])){
        for(memset(hash,0,sizeof(hash)),l[0]=strlen(sell),i=0;i<l[0];++hash[sell[i]],i++);
        for(l[1]=strlen(need),i=0;i<l[1];--hash[need[i]],i++);
        for(l[0]=l[1]=i=0;i<128;hash[i]<0?(l[1]+=-hash[i]):(l[0]+=hash[i]),i++);
    }
}

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String a = in.next();
		String my = in.next();
		int[] arr = new int[62];
		for(int i = 0;i<my.length();i++)
			arr[index(my.charAt(i))]++;
		for(int i = 0;i<a.length();i++)
			arr[index(a.charAt(i))]--;
		int need = my.length();
		int miss = 0;
		for(int i = 0;i<my.length();i++){
			int index = index(my.charAt(i));
			if(arr[index]<=0)
				need--;
			else{
				miss += arr[index];
				arr[index] = 0;
			}
		}
		if(need==0){
			need = 0;
			for(int i = 0;i<arr.length;i++){
				if(arr[i]<0)
					need += -arr[i];
			}
			System.out.println("Yes"+" "+need);
		}else {
			System.out.println("No"+" "+miss);
		}
			
	}
	private static int index(char c){
		if(c>='a'&&c<='z')
			return c-'a';
		if(c>='A'&&c<='Z')
			return 26+c-'A';
		if(c>='0'&&c<='9')
			return 26+26+c-'0';
		return -1;
	}
}

#include<iostream>
#include<string>
using namespace std;

int main(){
    ios::sync_with_stdio(false);  // 提高了速度
    
    int sign ,hash[123] = {0};
    string str_good, str_need;
    sign = 0;
    cin>>str_good>>str_need; 
    
    for(char c : str_good) hash[c]++; 
    for(char c : str_need)
        if(hash[c])
            hash[c]--;
        else
            sign++;
    cout<<(sign?"No": "Yes")<<" "<<(sign?sign:str_good.size() - str_need.size());
   return 0;
}

import java.util.HashMap;
import java.util.Scanner;

public class PAT29 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        HashMap<Character, Integer> map = new HashMap<>();
        String sample = scanner.next();
        String target = scanner.next();
        int length = sample.length();
        for (int i = 0; i < length; i++) {
            map.merge(sample.charAt(i), 1, Integer::sum);
        }
        int targetLen = target.length();
        int leak = 0;//缺少
        char ch;
        for (int i = 0; i < targetLen; i++) {
            ch = target.charAt(i);
            Integer value = map.get(ch);
            if (value == null || value == 0) {
                leak++;
            }else {
                map.put(ch, value-1);
            }
        }
        if (leak == 0) {
            System.out.println("Yes " + (length - targetLen));
        } else {
            System.out.println("No " + leak);
        }
        scanner.close();
    }
}

import java.util.*;
public class Main{
    public static void main(String []args){
        Scanner in=new Scanner(System.in);
        List<Character>list1=new ArrayList<>();
        List<Character>list2=new ArrayList<>();
        String s1=in.next();
        String s2=in.next();
        for(char c:s1.toCharArray())
        {
            list1.add(c);
        }
        for(char c:s2.toCharArray())
        {
            list2.add(c);
        }
        int count=0;
        for(char c2:list2) {
            for(char c1:list1) {
                if(c2==c1) {
                    list1.remove(list1.indexOf(c1));
                    count++;
                    break;
                }
            }
        }
        if(count==list2.size()) {
            System.out.print("Yes"+" "+(s1.toCharArray().length-list2.size()));
        }
        else
             System.out.print("No"+" "+(list2.size()-count));
    } 
}

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;


public class Main{
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		boolean weatherBy = true;
		int lack = 0;
		int redundant = 0;
		Scanner sc = new Scanner(System.in);
		String have = sc.nextLine();
		String need = sc.nextLine();
		Map <Character,Integer> h = new HashMap<>();
		Map <Character,Integer> n = new HashMap<>();
		for (char c:have.toCharArray()) {
			if(h.containsKey(c)){
				h.put(c, h.get(c)+1);
			}else{
				h.put(c, 1);
			}
		}
		for (char c : need.toCharArray()) {
			if(n.containsKey(c)){
				n.put(c, n.get(c)+1);
			}else{
				n.put(c, 1);
			}
		}
		Iterator<Entry<Character, Integer>> it = n.entrySet().iterator();
		while(it.hasNext()){
			Entry<Character, Integer> en = it.next();
			char k = en.getKey();
			int v = en.getValue();
			if(h.containsKey(k) && h.get(k)<v){
				weatherBy = false;
				lack += v -h.get(k);
			}else if(! h.containsKey(k)){
				weatherBy = false;
				lack += v;
			}
		}
		if(weatherBy == true){
			System.out.println("Yes "+(have.length()-need.length()));
		}else{
			System.out.println("No "+lack);
		}
	}

}

	#include<iostream>



	#include<string>



	using namespace std;



	 



	// PAT乙级到底买不买（20）



	 



	intmain()



	{



	    string str1,str2;



	    cin>>str1>>str2;



	    intstr1length=str1.length();



	    intstr2length=str2.length();



	    inti,j,num1=0,num2=0;



	    for(i=0;i<str1length;i++){



	        for(j=0;j<str2length;j++){



	            if(str1[i]==str2[j]){



	                str1[i]='#';



	                str2[j]='#';



	                continue;



	            }



	        }



	    }



	    //caculate the str1 remanding number



	    for(i=0;i<str1length;i++){



	        if(str1[i]!='#')



	            num1++;



	    }



	    //caculate the str1 remanding number



	    for(j=0;j<str2length;j++){



	        if(str2[j]!='#')



	            num2++;



	    }



	    //num2 > 0 suggests str1 is lack of some number,output the num2



	    //else  output num1



	    if(num2)



	        cout<<"No "<<num2<<endl;



	    else



	        cout<<"Yes "<<num1<<endl;



	    return0;



	}

#include <iostream> 
using namespace std;
int main()
{
	char a[1000] = { 0 };
	char b[1000] = { 0 };
	cin >> a >> b;
	int remain = 0;
	int k;
	int n = 0;
	int m = 0;
	for (int i = 0; b[i] != '\0'; i++)
	{
		n++;
		k = 0;
		for (int j = 0; a[j] != '\0'; j++)
		{
			m++;
			if (a[j] == b[i])
			{
				k = 1;
				a[j] = '*';
				break;
			}
		}
		if (k == 0)
			remain++;
	}
	if (remain == 0)
		cout << "Yes" << " " << m / n - n;
	else cout << "No" << " " << remain;
	return 0;
}