A - About Grisha N.

最新推荐文章于 2018-06-05 12:48:00 发布

sdau20163940

最新推荐文章于 2018-06-05 12:48:00 发布

阅读量400

点赞数 1

分类专栏： 2017年省赛赛前训练赛

本文链接：https://blog.csdn.net/sinat_37668729/article/details/71036130

版权

2017年省赛赛前训练赛专栏收录该内容

57 篇文章 0 订阅

订阅专栏

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.

Example

input	output
7	YES
5	NO

Hint

水题，直接上代码！！！

#include<bits./stdc++.h>
using namespace std;
int main()
{
	//freopen("aaa.txt","r",stdin);
	int n;
	cin>>n;
	if(n>=7) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	return 0;
}