Two Ranges
Chef has two ranges $[A, B]$ and $[C, D]$. Chef needs to find the number of integers that belong to **at least** one of the ranges. Note: A range $[P, Q]$ contains **all** the integers $\{P, P+1, P+2, \dots, Q-1, Q\}$. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of a single line containing $4$ integers $A, B,
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.
Sign in to chat with the tutor and save your progress.
Sign in to start