ural 2012 About Grisha N.（水）

2012. About Grisha N.

Time limit: 1.0 second
Memory limit: 64 MB

Grisha N. told his two teammates that he was going to solve all given problems at the subregional contest, even if the teammates wouldn’t show up at the competition. The teammates didn’t believe Grisha so he told them the plan how he was going to do this.

During the first hour he wants to solve f problems. If there is still some time left to the end of the first hour, Grisha will simply walk along the hall. Beginning from the second hour Grisha wants to spend exactly 45 minutes on each of the problems left. If the plan is a success, will Grisha be able to solve all 12 given problems for 5 hours?

Input

The only line contains an integer f that is the number of problems Grisha wants to solve during the first hour of the competition (1 ≤ f ≤ 11).

Output

Output “YES”, if Grisha manages to solve all the given problems alone, and “NO” if he doesn’t.

Samples

input	output
7	YES
5	NO

Problem Author: Alexander Ipatov (prepared by Olga Soboleva)
Problem Source: NEERC 2014, Eastern subregional contest

Tags: problem for beginners (hide tags for unsolved problems)

Difficulty: 20 Printable version Submit solution Discussion (5)
All submissions (11903) All accepted submissions (6914) Solutions rating (5478)

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     int f;

     int tm =  * ;

     int tm2;

     while (~scanf("%d", &f)) {

         tm2 =  * ( - f);

         if (tm2 <= tm) {

             printf("YES\n");

         } else {

             printf("NO\n");

         }

     }

     return ;

 }

巴特西

ural 2012 About Grisha N.（水）

2012. About Grisha N.

Input

Output

Samples

最新文章

热门文章