#include #include #include using namespace std; int memo[11][101][10001]; int a1000, a100, a1, db, b1000, b100, b1, dc, c1000, c100, c1; tuple how_to_pay(int sum, int num1000, int num100, int num1) { int use1000, use100, use1; use1000 = min(sum / 1000, num1000); sum -= use1000 * 1000; use100 = min(sum / 100, num100); sum -= use100 * 100; use1 = min(sum / 1, num1); sum -= use1 * 1; return make_tuple(use1000, use100, use1); } int solve(int num1000, int num100, int num1) { if (memo[num1000][num100][num1] >= 0) { return memo[num1000][num100][num1]; } // 貨幣を大きい方から使っていけば良い int res = 0, use1000, use100, use1; tuple payment; // Bさんと交換 payment = how_to_pay(db, num1000, num100, num1); use1000 = get<0>(payment); use100 = get<1>(payment); use1 = get<2>(payment); if (1000 * use1000 + 100 * use100 + use1 == db) { res = max(res, solve(num1000 - use1000 + b1000, num100 - use100 + b100, num1 - use1 + b1) + 1); } payment = how_to_pay(dc, num1000, num100, num1); use1000 = get<0>(payment); use100 = get<1>(payment); use1 = get<2>(payment); if (1000 * use1000 + 100 * use100 + use1 == dc) { res = max(res, solve(num1000 - use1000 + c1000, num100 - use100 + c100, num1 - use1 + c1) + 1); } return memo[num1000][num100][num1] = res; } int main() { cin >> a1000 >> a100 >> a1; cin >> db; cin >> b1000 >> b100 >> b1; cin >> dc; cin >> c1000 >> c100 >> c1; memset(memo, -1, sizeof(memo)); cout << solve(a1000, a100, a1) << endl; return 0; }