← All problemsSign in

High School Xor Sum

Given an array Ar with N elements, indexed from 1 to N. Now you will be given two type of query- - 1 i j (Print the xor sum of all value from indx i to j ) - 2 i V (Change the ith value of the Ar by V. that means, after that operation Ar-i=V) Input The first line contains two integers N (1 - 1 i j - 2 i V Output For each 2nd type query you have to print a line containing the Xor Sum.

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

Sign in to chat with the tutor and save your progress.

Sign in to start