Mommiez Errands
CodeChefOpen on judge ↗
Chef likes playing with matrices. He has a matrix $X$ of size $n*m$, which is initialized to $0$ (i.e. for each $$0 \leq i \lt n , 0 \leq j \lt m , X[i][j] = 0 $$). Chef’s mommy has a list of size $s$ that contains special indices. For each special index $[a, b]$ (assume 0-based indexing), she wants Chef to perform the following operations: - Increment the value of all the cells on row $a$. -
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start