URAL 2012. About Grisha N.
来源:互联网 发布:建筑工程造价软件 编辑:程序博客网 时间:2024/06/16 05:46
2012. About Grisha N.
Time limit: 1.0 second
Memory limit: 64 MB
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
7
YES
5
NO
我只能说这是一道好水好水的题啊...直接上代码
#include<cstdio>#include<iostream>using namespace std;int main(){ int f; while(cin>>f) { if(60+(12-f)*45<=300) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}
0 0
- URAL 2012. About Grisha N.
- Ural 1313. Some Words about Sport
- ural 1104. Don’t Ask Woman about Her Age
- Ural 1104. Don’t Ask Woman about Her Age
- URAL 1313 Some Words about Sport (阅读理解)
- URAL
- 【ural】
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- 开源游戏引擎详解
- 6、R语言,调用自编函数
- 给定字符串,求出现次数最多的那个字母及次数,如有多个重复则都输出
- 流媒体一
- UI中常用的控件Slider\SegmentCtrl\PageCtrl
- URAL 2012. About Grisha N.
- poj 3070(矩阵快速幂)
- live555类关系图
- 02引言-AngularJS基础教程
- Codeforces Round #296 (Div. 2) C(STL_set)
- Mac下/usr/include缺失
- js闭包
- nginx和apache设置不缓存文件
- 稀疏表示介绍(上)