Algorithm


 problem Link : https://www.codechef.com/problems/TIMELY 

Problem

Chef has recently moved into an apartment. It takes 30 minutes for Chef to reach office from the apartment.

Chef left for the office � minutes before Chef was supposed to reach. Determine whether or not Chef will be able to reach on time.

Input Format

  • The first line of input will contain a single integer �, denoting the number of test cases.
  • Each test case consists of a single integer �.

Output Format

For each test case, output YES if Chef will reach on time, NO otherwise.

The output is case-insensitive. Thus, the strings YES, yes, yeS, and Yes are all considered the same.

Constraints

  • 1≤�≤60
  • 1≤�≤60

Sample 1:

Input
 
Output
 
6
30
60
14
29
31
42
YES
YES
NO
NO
YES
YES

Explanation:

Test case 1: Chef leaves 30 minutes before he is supposed to reach, so he will reach the office exactly on time since it takes 30 minutes to commute.

Test case 2: Chef will reach 30 minutes early.

Test case 3: Chef will reach 16 minutes late.

Code Examples

Advertisements

Demonstration


CodeChef solution TIMELY  - Reach on Time Codechef solution in C,C++

Previous
CodeChef solution TAXES - Tax in Chefland CodeChef solution in C,C++
Next
CodeChef solution AUDIBLE - Audible Range CodeChef solution in C,C++