Not a Cakewalk

CodeChefOpen on judge ↗

Chef and Nuttela is busy doing homeworks. Nuttela has faced some math problem and asks Chef to solve it out for him. Nuttela is weak in dealing matrices and so needs Chef help to complete in within a given deadline. Chef asks you to solve it. You are given a N x M matrix. Then you are given two types of queries - 0 and 1. For the queries of type 0, you need to update the value at index (x, y) to

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.

voice by Sarvam AI