Nice Queries

CodeChefOpen on judge ↗

You're given an array of size $10^9$. All the elements are initialized to 1. You have to perform q queries. The queries are of two types: Query1: 1 L R VAL : Multiply all the elements in range L to R with value, VAL, Query2: 2 INDEX : Find the product at a given index INDEX. You'll have to do the processing online. For that purpose, we're encrypting all the queries with xor of the res

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