Primary School Xor Sum

CodeChefOpen on judge ↗

Given an array A with N elements, indexed from 1 to N. Now you will be given some queries in the form I J, your task is to find the Xor Sum of all the value from I to J. Input The first line contains two integers N (1Output For each query you have to print a line containing the Xor Sum. Samples Sample Input Sample Output 5 3 1 2 3 4 5 3 3 3 4 1 3 3 7 0

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