70分求调

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include <iostream>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <climits>

using namespace std;

int max_occurrences(const string& x, const string& s) {
    unordered_map<char, int> count;
    for (char c : s) {
        count[c]++;
    }
    count['2'] += count['5'];
    count['5'] = count['2'];
    count['6'] += count['9'];
    count['9'] = count['6'];
    
    unordered_map<char, int> x_count;
    for (char c : x) {
        x_count[c]++;
    }
    
    int max_possible = INT_MAX;
    for (auto& pair : x_count) {
        char d = pair.first;
        int required = pair.second;
        
        int available;
        if (d == '2' || d == '5') {
            available = count['2'];
        } else if (d == '6' || d == '9') {
            available = count['6'];
        } else {
            available = count[d];
        }
        
        if (available < required) {
            return 0;
        }
        max_possible = min(max_possible, available / required);
    }
    
    return max_possible;
}

int main() {
    string x, s;
    cin >> x >> s;
    cout << max_occurrences(x, s) << endl;
    return 0;
}
//改对必关