Leg Space
There are $N$ students **including** Chef in a school. The school bus has $M$ seats, and every student in the school travels on the bus. It is guaranteed that $N \leq M$, so that everyone will have a seat. Chef is happy when the school bus is *not* full. Given $N$ and $M$, your task is to find out whether Chef will be happy. ### Input The only line of input will contain two space-separated i
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