二分答案 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

题意：做一个汉堡包需要B,S,C三种材料，给出原来各有多少材料和购买这些材料的单价，有n金币，求最多做多少汉堡包。

二分答案，去一个足够大的数作为上界，0为下界，每次Judge判断满不满足，满足则继续向上。

#include <iostream>
#include <cstdio>
#include<cstring>
#include <cstdlib>
#include <algorithm>

typedef long long ll;
using namespace std;
char str[150];
ll b, s, c, n1, n2, n3, p1, p2, p3, n;

ll max(ll x, ll y)
{
    return x > y ? x : y;
}

bool Judge(ll x)
{
    ll nb = max((x*b - n1)*p1, 0);
    ll ns = max((x*s - n2)*p2, 0);
    ll nc = max((x*c - n3)*p3, 0);
    return nb+ns+nc > n; // 花费是否比拥有金币大
}

int main()
{
    while(~scanf("%s", str)) {
        scanf("%lld%lld%lld%lld%lld%lld%lld", &n1, &n2, &n3, &p1, &p2, &p3, &n);
        b = 0, s = 0, c = 0;
        for(int i = 0; i < strlen(str); i++) {
            if(str[i] == 'B') b++;
            else if(str[i] == 'S') s++;
            else c++;
        }

        ll mid, l = 0, r = 1e15;
        while(r >= l) {
            mid = (l+r) / 2;
            if(Judge(mid)) r = mid - 1;
            else l = mid + 1;
        }
        printf("%lld\n", r);
    }
    return 0;
}