Codeforces 371C Hamburgers 简单二分

C. Hamburgers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 %I64d specifier.

Output

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

Examples

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 code：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <map>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
#define eps 1
const int mod=1000000000+7;
const int maxn=1000005;

char s[105];

struct node1{
    int c1,c2,c3;   //一块汉堡所需各种材料数量
    int pb,ps,pc;   //材料单价
}h;

struct node2{
    int nb,ns,nc;   //自己有多少块
    LL rub;         //自己有多少钱
}p;

LL abs(LL n,LL pn){
    //如果厨房材料足够就不用买
    return pn>=n?0:(n-pn);
}

int judge(LL n){
    LL tb=abs(h.c1*n,p.nb)*h.pb;
    LL ts=abs(h.c2*n,p.ns)*h.ps;
    LL tc=abs(h.c3*n,p.nc)*h.pc;
    LL tsum=tb+ts+tc;
    if(p.rub>=tsum) return 1;
    else if(p.rub<tsum) return 0;
}

int main() {
    while(~scanf("%s",s)){
        scanf("%d%d%d%d%d%d%I64d",&p.nb,&p.ns,&p.nc,&h.pb,&h.ps,&h.pc,&p.rub);
        h.c1=h.c2=h.c3=0;
        for(int i=0;i<strlen(s);i++){
            if(s[i]=='B') h.c1++;
            else if(s[i]=='S') h.c2++;
            else h.c3++;
        }

        //右边界应该是钱数加上他自己最多的材料数
        LL l=0,r=p.rub+200,ans=0;
        while(l<=r){
            LL mid=(r+l)/2;
            int res=judge(mid);
            if(res==1) {
                ans=max(mid,ans);
                l=mid+1;
            }
            else r=mid-1;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}