← All problemsSign in

Chef and Sweets

Chef has prepared two types of sweets in the quantity $A$ and $B$ respectively. He wants to distribute these sweets to maximum people such that each person gets total $3$ sweets and has at least one sweet of each type. Can you tell maximum number of people to whom Chef can distribute ? ### Input: - First line will contain two space separated integers $A$, $B$. ### Output: For each testcase, out

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