- Chef wants to appear in a competitive exam. To take the exam, there are the following requirements:
- The minimum age limit is X (i.e. Age should be greater than or equal to X).
- Age should be strictly less than Y.
- The chef's current Age is A. Find whether he is currently eligible to take the exam or not.
- First-line will contain T, the number of test cases. Then the test cases follow.
- Each test case consists of a single line of input, containing three integers X, Y, and A as mentioned in the statement.
- For each test case, output YES if Chef is eligible to give the exam, NO otherwise.
- You may print each character of the string in uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).
- 1 ≤ T ≤ 1000
- 20 ≤ X < Y ≤ 40
- 10 ≤ A ≤ 50
Sample Input:
5
21 34 30
25 31 31
22 29 25
20 40 15
28 29 28
Sample output:YES
NO
YES
NO
YES
Explanation:- Test case 1: The age of the Chef is 30. His age satisfies the minimum age limit as 30 ≥ 21. Also, it is less than the upper limit of 30 < 34. Thus, Chef is eligible to take the exam.
- Test case 2: The age of the Chef is 31. His age satisfies the minimum age limit as 31 ≥ 25. But, it is not less than the upper limit of 31 ≮ 31. Thus, Chef is not eligible to take the exam.
- Test case 3: The age of the Chef is 25. His age satisfies the minimum age limit as 25 ≥ 22. Also, it is less than the upper limit of 25 < 29. Thus, Chef is eligible to take the exam.
- Test case 4: The age of the Chef is 15. His age does not satisfy the minimum age limit of 15 < 20. Thus, Chef is not eligible to take the exam.
for _ in range(int(input())):
x, y, a = list(map(int,input().split()))
if a >= x and a < y:
print("YES")
else:
print("NO")
Note: The problem statement is given by codechef.com but the solution is generated by the Geek4Tutorial admin. We highly recommend you solve this on your own, however, you can refer to this in case of help. If there is any concern regarding this post or website, please contact us using the contact form. Thank you!
No comments:
Post a Comment