Hamburgers - CodeForces 371C 二分-优快云博客

Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe go from bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.

Polycarpus has nb pieces of bread, ns pieces of sausage and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles for a piece of bread, ps for a piece of sausage and pc for a piece of cheese.

Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.

Input

The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B), 'S' (uppercase English S) and 'C' (uppercase English C).

The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012) — the number of rubles Polycarpus has.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Output

Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.

Sample test(s)

input
BBBSSC
6 4 1
1 2 3
4

output
2

input
BBC
1 10 1
1 10 1
21

output
7

input
BSC
1 1 1
1 1 3
1000000000000

output
200000000001

思路：用二分的方法求最多能做几个汉堡，简单安全。

AC代码如下:

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long han[4],num[4],pri[4],m;
char s[110];
bool solve(long long mi)
{ long long num1=mi*han[1],num2=mi*han[2],num3=mi*han[3];
  num1=max(0LL,num1-num[1]);
  num2=max(0LL,num2-num[2]);
  num3=max(0LL,num3-num[3]);
  if(num1*pri[1]+num2*pri[2]+num3*pri[3]-m<=0)
    return true;
  else
    return false;
}
int main()
{ int i,j,k,len;
  long long l,r,mi;
  scanf("%s",s);
  len=strlen(s);
  han[1]=0;
  han[2]=0;
  han[3]=0;
  for(i=0;i<len;i++)
   if(s[i]=='B')
    han[1]++;
   else if(s[i]=='S')
    han[2]++;
   else
    han[3]++;
  scanf("%I64d%I64d%I64d",&num[1],&num[2],&num[3]);
  scanf("%I64d%I64d%I64d",&pri[1],&pri[2],&pri[3]);
  scanf("%I64d",&m);
  l=0;r=100000000000000LL;
  while(l<r)
  { mi=(l+r+1)/2;
    if(solve(mi))
     l=mi;
    else
     r=mi-1;
  }
  printf("%I64d\n",l);
}