URAL 2012. About Grisha N.
2015-03-24 19:31
1036 查看
2012. About Grisha N.
Time limit: 1.0 secondMemory 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 |
#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; }
相关文章推荐
- URAL 1306. Sequence Median(优先队列)
- URAL 1181 Cutting a Painted Polygon(解题报告)
- 算法艺术与信息学竞赛习题1.2.6——离散数学(ural1010 )
- Ural 1750. Pakhom and the Gully
- [代码]ural 1913 Titan Ruins: Old Generators Are Fine Too
- ural 1126. Magnetic Storms
- ural Sightseeing Trip(最短环)
- URAL 1348 求垂足
- ural DP 1225
- URAL 1489 Points on a Parallelepiped
- ural 1028 Stars [线段树]
- ural1297——Palindrome(后缀数组)
- ural 1011. Conductors
- Ural 1495
- Ural 1326
- URAL1780----格雷码的应用,数论
- Ural 1090. In the Army Now
- ural 1024. Permutations
- Ural-1025. Democracy in Danger(水题)
- 1769. Old Ural Legend [ACM]