some programs

dp/backpack_dp/NOIP2006S_jinming_budget_dp_knapsack.cpp

@@ -50,7 +50,7 @@ vector<FlatItem> generate_flat_items(OriginalItem item) {
 void solve_dp() {
     for (int i = 0; i < n; i++) {
         if (items[i].item.value == -1) { continue; }
-        for (int w=capacity; w>=1; w--) {
+        for (int w = capacity; w >= 1; w--) {
             // dp[w] = dp[w] // 不买
             for (const auto& [weight, value] : generate_flat_items(items[i])) {
                 if (w >= weight) {