Rush to Exam
Chef has an exam in the next $N$ hours, and he still has to read $M$ pages of a book to be fully prepared for the exam. Every hour, Chef reads is able to read exactly $A$ pages. Will Chef be able to read all $M$ pages before the exam? Print $\text{Yes}$ or $\text{No}$ accordingly. ### Input - The first and only line contains $3$ integers - $N$, $M$ and $A$. ### Output Print $\text{Yes}$ if Chef
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