求最小的 k[i]k[i]k[i] 使得∀1≤j≤n,c[i]j≤bj \forall 1\le j \le n, c[i]_j \le b_j∀1≤j≤n,c[i]j≤bj
应改为
求最小的 k[i]k[i]k[i] 使得 ∀1≤j≤n,c[i]j<bj \forall 1\le j \le n, c[i]_j < b_j∀1≤j≤n,c[i]j<bj
求最小的 $k[i]$ 使得$ \forall 1\le j \le n, c[i]_j < b_j$
