#include <bits/stdc++.h> #define int long long using namespace std; template<typename T, typename... Args> void print(T t) {cout << t << '\n';} template<typename T, typename... Args> void print(T t, Args... args) {cout << t << " "; print(args...) ;} const int S = 2005 , MX = 1e9+7; int dp0[S] , dp1[S]; int n , s , cnt , ans = -MX; vector<int> v; vector<int> w; void file_input() { if (fopen("inp.txt" , "r")) { freopen("inp.txt" , "r" , stdin); freopen("out.txt" , "w" , stdout); } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); file_input(); cin >> s >> n; while (n--) { int a , b , k , sm; cin >> a >> b >> k; sm = k; for (int p = 0; (k>>p) > 1; p++) { v.push_back(a<<p); w.push_back(b<<p); cnt++; sm -= (1<<p); } v.push_back(a*sm); w.push_back(b*sm); cnt++; } for (int i = 1; i < S; i++) {dp0[i] = dp1[i] = -1;} for (int i = 0; i < cnt; i++) { for (int p = 0; p <= s; p++) { if (dp0[p] == -1) {continue;} dp1[p] = max(dp1[p] , dp0[p]); if (p+w[i] > s) {continue;} dp1[p+w[i]] = max(dp1[p+w[i]] , dp0[p]+v[i]); } for (int p = 0; p <= s; p++) {dp0[p] = dp1[p];} } for (int p = 0; p <= s; p++) { ans = max(ans , dp0[p]); } cout << ans; return 0; }

knapsack.cpp: In function 'void file_input()':
knapsack.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen("inp.txt" , "r" , stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen("out.txt" , "w" , stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~