ZeptoLab Code Rush C. Om Nom and Candies

1. Title Description: Click to open the link

2. Problem-Solving ideas: The topic is the question of infinite knapsack, according to the constraint relationship of weight, direct violence search.

3. Code:

#define _crt_secure_no_warnings #include <iostream> #include <algorithm> #include <string> #include <sstream> #include <set> #include <vector> #include <stack> #include <map> #include < queue> #include <deque> #include <cstdlib> #include <cstdio> #include <cstring> #include < cmath> #include <ctime> #include <functional>using namespace std;typedef long Long ll;ll C, HR, WR, HB, WB; int main () {//freopen ("T.txt", "R", stdin), while (Cin >> C >> HR >> HB >> WR >> WB) {ll ans = 0;for (ll i = 0; i < 100000; i++) {if (i*wr <= c) ans = max (ans, i*hr + (c-wr*i)/WB*HB); if (I*WB <= c) ans = ma X (ans, I*HB + (c-wb*i)/wr*hr);} cout << ans << endl;} return 0;}

ZeptoLab Code Rush C. Om Nom and Candies