For UNSAT problems with 10 variables and 200 clauses it had the same issue as others: making up assignments.
描述：prices[i] 为第 i 件商品价格。第 i 件商品可获得折扣 prices[j]，其中 j 是满足 j i 且 prices[j] <= prices[i] 的最小下标；若无则无折扣。返回每件商品折扣后的最终价格。
，详情可参考91视频
Медведев вышел в финал турнира в Дубае17:59
A code card for Pokémon TCG Live