Ceiling Sum

CodeChefOpen on judge ↗

You are given two integers *A*,*B*. You have to choose an integer **X** in the range **[minimum(A,B), maximum(A,B)]** such that: **ceil((B - X)/2) + ceil((X - A)/2)** is maximum. What is the maximum sum you can obtain if you choose *X* optimally? Note: ceil(X) is the smallest integer greater than or equal to X ### Input * First line will contain *T*, number of testcases. Then the testcases fo

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