PROBLEM LINK:
Practice
Contest: Division 1
Contest: Division 2
Contest: Division 3
Contest: Division 4
Author: raysh07
Tester: sushil2006
Editorialist: iceknight1093
DIFFICULTY:
Cakewalk
PREREQUISITES:
None
PROBLEM:
Chef has N hours to prepare for an exam.
He can read A pages per hour, and needs to read M pages to be fully prepared.
Does he have enough time?
EXPLANATION:
At A pages per hour, Chef can read N\cdot A pages in N hours.
So,
- If N\cdot A \ge M, Chef can read all M pages.
The answer is"Yes". - If N\cdot A \lt M, Chef doesn’t have enough time.
The answer is"No".
TIME COMPLEXITY:
\mathcal{O}(1) per testcase.
CODE:
Editorialist's code (PyPy3)
n, m, a = map(int, input().split())
print('Yes' if n*a >= m else 'No')