Every year the CSE Department of ULAB tries to identify "The Best Future Programmer" by a simple time-based performance criteria. This criteria is an indication of a programmer's daily activity.
A good programmer always tries to solve or more problems in a day. They invest a minimum of hours to read the programming books/blogs. And, they participate in at least contest within a week.
Aman is tasked with evaluating the performance of this year’s students. He is given , the number of days since when the student started practicing, , the number of problems he has solved within these days, , the total hours of reading programming books and blogs in these days, and , the total number of contests participated in these days.
Aman needs your help writing a program to do this. You can assume that if, for example, someone has solved problems in days, then it doesn’t matter on which exact days the student has solved the problems as long as the criteria is fulfilled. The same applies for and .
The first line contains (), the number of test cases.
The only line of each test case will contain four integers separated by space,
() — Number of days.
() — Number of problems solved within days.
() — Total hours of reading books/blogs within days.
() — Total contest participation within days.
For each test case, you have to print if Aman’s performance matches with the described criteria otherwise print .
5 1 3 3 1 6 19 20 0 7 25 24 0 7 25 24 1 10000 30000 30000 1428
Yes Yes No Yes Yes
Login to submit
Let’s find per day activity. You have to solve a minimum of 3 problems (per_day_P = P / N) and inves...