Give Away

CodeChefOpen on judge ↗

You are given a 1-indexed array X, consisting of N integers, and a set of Q queries. There are two kinds of queries: 1. 0 a b c Here you are required to return the number of elements with indices in [a,b] greater than or equal to c 2. 1 a b Here you are required to change the ath element of array to b. Input Format: First line contains N, the number of elements in the array X. The next l

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