#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <bitset>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define N 10010
#define inf 2000000000000
using namespace std;
int main()
{
string a;
cin>>a;
long long nb,ns,nc;
cin>>nb>>ns>>nc;
long long pb,ps,pc;
cin>>pb>>ps>>pc;
long long money;
cin>>money;
long long b=0,s=0,c=0;
for(int i=0;i<a.length();i++)
{
if(a[i]=='B')
{
b++;
}
else if(a[i]=='S')
{
s++;
}
else if(a[i]=='C')
{
c++;
}
}
long long left=0,right=inf,mid;
while(left<right)
{
mid=(left+right)/2;
long long need=max((long long)0,(mid*b-nb)*pb)+max((long long)0,(mid*s-ns)*ps)+max((long long)0,(mid*c-nc)*pc);
if(money>=need)
{
left=mid+1;
}
else
{
right=mid;
}
}
cout<<left-1<<endl;
return 0;
}
CodeForces - 371C Hamburgers
最新推荐文章于 2021-09-19 23:17:56 发布