← All problemsSign in

Balls and Boxes

CodeChefRating 994Open on judge ↗

You have $N$ balls and $K$ boxes. You want to divide the $N$ balls into $K$ boxes such that: - Each box contains $\ge 1$ balls. - No two boxes contain the same number of balls. Determine if it is possible to do so. ### 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 test case contains two space-separa

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