← All problemsSign in

Addition

CodeChefRating 1927Open on judge ↗

Recently, Chef studied the [binary numeral system](https://en.wikipedia.org/wiki/Binary_number) and noticed that it is extremely simple to perform bitwise operations like [AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND), [XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) or [bit shift](https://en.wikipedia.org/wiki/Bitwise_operation#Bit_shifts) on non-negative integers, while it

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