CodeForces 371C Hamburgers （二分）

O - Hamburgers

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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 n_b pieces of bread, n_s pieces of sausage and n_c pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are p_b rubles for a piece of bread, p_s for a piece of sausage and p_c 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 n_b, n_s, n_c (1 ≤ n_b, n_s, n_c ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers p_b, p_s, p_c (1 ≤ p_b, p_s, p_c ≤ 100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 10¹²) — 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 Input

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

思路：直接二分查找能得到的汉堡个数

#include<stdio.h>
#include<string.h>
#include<iostream>
const long long eps = 1e13;
using namespace std;
__int64 judge(__int64 a,__int64 b,__int64 c,__int64 mid)
{
	if(mid*c>=a)
	return (mid*c-a)*b;
	else 
	return 0;
}
int main()
{
	char str[110];
    __int64 m,n;
	__int64 i,j,k,l,a1,a2,a3,b1,b2,b3,c1,c2,c3;
    while(scanf("%s",str)!=EOF)
    {
    	scanf("%I64d%I64d%I64d",&a1,&a2,&a3);
    	scanf("%I64d%I64d%I64d",&b1,&b2,&b3);
    	scanf("%I64d",&m);
    	int len=strlen(str);
    	c1=c2=c3=0;
    	for(i=0;i<len;i++)
    	{
    		if(str[i]=='B')
    		c1++;
    		else if(str[i]=='S')
    		c2++;
    		else
    		c3++;
		}
		__int64 left=0;
		__int64 right=eps;
		__int64 ans;
		while(left<=right)
		{
			__int64 mid=(left+right)/2;
			__int64 sum1=judge(a1,b1,c1,mid);
			__int64 sum2=judge(a2,b2,c2,mid);
			__int64 sum3=judge(a3,b3,c3,mid);
			if(sum1+sum2+sum3<=m)
			{
				ans=mid;
				left=mid+1;
			}
			else
			{
				right=mid-1;
			}
		}
		printf("%I64d\n",ans);
	}
	return 0;
}