Equal Integers

CodeChefRating 852Open on judge ↗

Chef has two integers $X$ and $Y$. Chef wants to perform some operations to make $X$ and $Y$ equal. In one operation, Chef can either: - set $X := X + 1$ - or set $Y := Y + 2$ Find the minimum number of operations required to make $X$ and $Y$ equal. ### Input - The first line contains a single integer $T$ — the number of test cases. Then the test cases follow. - The first and only line of each

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