题目 90分
玄关

#include<bits/stdc++.h>
using namespace std;
map<char,int>in;
int a2,a5,a6,a9;
int main()
{
	int k=1000001; 
	string a,s;
	cin>>a>>s;
	for(int i=0;i<s.size();i++)in[s[i]]++;
	for(int i=0;i<a.size();i++) {
	   if(a[i]=='2')a2++;
	   if(a[i]=='5')a5++;
	   if(a[i]=='6')a6++;
	   if(a[i]=='9')a9++;
	}
	if(a2>0&&a5>0)in['2']=(in['2']+in['5'])/(a2+a5)*a2,in['5']=(in['2']+in['5'])/(a2+a5)*a5;
	if(a6>0&&a9>0)in['6']=(in['6']+in['9'])/(a6+a9)*a6,in['9']=(in['6']+in['9'])/(a6+a9)*a9;
	if(a2>0&&a5==0)in['2']=(in['2']+in['5'])/a2;
	if(a5>0&&a2==0)in['5']=(in['2']+in['5'])/a5;
	if(a6>0&&a9==0)in['6']=(in['6']+in['9'])/a6;
	if(a9>0&&a6==0)in['9']=(in['6']+in['9'])/a9;
	for(int i=0;i<a.size();i++)k=min(k,in[a[i]]);
	cout<<k;
	return 0;
}