PROBLEM LINK:
Practice
Contest: Division 1
Contest: Division 2
Contest: Division 3
Contest: Division 4
Author:
Tester: sushil2006
Editorialist: iceknight1093
DIFFICULTY:
Cakewalk
PREREQUISITES:
None
PROBLEM:
Chef has solved X questions, and can solve at most 10 more worksheets, each of which has Y questions, in the remaining time he has.
Can he solve at least 100 questions?
EXPLANATION:
If Chef completes all 10 worksheets, he will solve a total of 10\cdot Y problems.
This means the maximum number of problems he can possibly solve is
X + 10\cdot Y
If this value is \lt 100 the answer is No, otherwise the answer is Yes.
TIME COMPLEXITY:
\mathcal{O}(1) per testcase.
CODE:
Editorialist's code (PyPy3)
x, y = map(int, input().split())
print('Yes' if x + 10*y >= 100 else 'No')