Preliminaries for Benelux Algorithm Programming Contest 2018 H to O

题目来源：
点击这里
代码如下：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
typedef long long ll;//A 65
using namespace std;
int main() {
	char s[2600],t[2600];
	long long min=1e10;
	int ans;
	long long a[30],b[30];
	int a1=0,b1=0;
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	scanf("%s",s);
	scanf("%d",&ans);
	scanf("%s",t);
	for(int i=0;i<strlen(s);i++){
		if(s[i]>=65 && s[i] <=90){
			a1=s[i]-65;
			if( i==strlen(s)-1 || (s[i+1]>=65 && s[i+1] <=90)){
				a[a1]++;
			}
		}
		else {
			long long  sum=0;
			int j;
			for(j=i;j<strlen(s);j++){
				if(s[j]>=65 && s[j] <=90) break;
					sum=sum*10+(s[j]-'0');
			}
			a[a1]+=sum;
			i=j-1;
		}
	}
	for(int i=0;i<strlen(t);i++){
		if(t[i]>=65 && t[i] <=90){
			b1=t[i]-65;
			if( i==strlen(t)-1 || (t[i+1]>=65 && t[i+1] <=90) )
				b[b1]++;
		}
		else {
			long long sum=0;
			int j;
			for(j=i;j<strlen(t);j++){
				if(t[j]>=65 && t[j] <=90) break;
					sum=sum*10+(t[j]-'0');
			}
			b[b1]+=sum;
			i=j-1;
		}
	}
	for(int i=0;i<26;i++){
		if(b[i]){
			long long  t=(a[i]*ans)/b[i];
			if(min>=t) min=t;
		}
	}
	/*for(int i=0;i<26;i++){
		if(a[i]){
			printf("%c %d\n",i+65,a[i]);
		}
	}
	printf("\n");
	for(int i=0;i<26;i++){
		if(b[i]){
			printf("%c %d\n",i+65,b[i]);
		}
	}*/
	printf("%d",min);
	return 0;
}