← All problemsSign in

Xor Pyramid Row

CSESBitwise OperationsOpen on judge ↗

Consider a xor pyramid where each number is the xor of lower-left and lower-right numbers. Here is an example pyramid: Given the bottom row of the pyramid, your task is to find the numbers on the k-th row from the top. Input The first line has two integers n and k: the size of the pyramid and the given row. The next line has n integers a_1,a_2,\dots,a_n: the bottom row of the pyramid. Output

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