Update app.py

app.py

@@ -94,13 +94,16 @@ def calculator(*args):
     and inventory constraints.
 
     Args:
-        *args (tuple): A tuple where the first element is Gabby's gold budget, the selected strategy for selling plants,
-                       and the subsequent elements represent the stock levels of
-                       each plant type.
+        *args (tuple): A tuple containing:
+            - budget (int): Gabby's gold budget.
+            - strategy (str): The selected strategy for selling plants ("MaximizeStock" or "MinimizeStock").
+            - extra_rate (int): The premium rate for selling plants.
+            - stocks (list of int): Stock levels of each plant type.
 
     Returns:
         str: A description of the optimal solution, including which plants to sell,
              the total gold earned, and the remaining inventory.
+             Returns an error message if no solution is found.
     """
     budget: int = args[0]  # 葭碧预算
     strategy: str = args[1]  # 出售策略
@@ -142,7 +145,7 @@ def calculator(*args):
 
     # 求解问题
     # CBC(Coin-or Branch and Cut)求解器使用分支定界算法来寻找整数规划问题的最优解
-    solver = pulp.getSolver("PULP_CBC_CMD")
+    solver = pulp.PULP_CBC_CMD(mip=True, msg=False)
     prob.solve(solver=solver)
 
     if pulp.LpStatus[prob.status] == "Optimal":
@@ -204,7 +207,7 @@ with gr.Blocks(css=css) as demo:
                 "0(Gabby's Acquisition)",
                 "+100%(Budding & Novice)",
                 "+200%(Junior & Practiced)",
-                "+300%(Natural & Master?)",
+                "+300%(Natural & Master)",
             ],
             value="0(Gabby's Acquisition)",
             type="index",