Gym 100507A About Grisha N. （水题）

About Grisha N.

题目链接：

http://acm.hust.edu.cn/vjudge/contest/126546#problem/A

Description

Grisha N. told his two teammates that he was going to solve all given problems at the quarter-finals, even
if all his 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 ? 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 ? — the number of problems Grisha wants to solve during the first hour
of the competition (1 ≤ ? ≤ 11).

Output

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

Examples

test answer
7 YES
5 NO

题意：

水题.

题解：

直接推导不等式就可以了.

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#define LL long long
#define eps 1e-8
#define maxn 550
#define mod 100000007
#define inf 0x3f3f3f3f
#define IN freopen("in.txt","r",stdin);
using namespace std;


int main(int argc, char const *argv[])
{
    //IN;

    int ff;
    while(scanf("%d", &ff) != EOF)
    {
        if((12-ff)*45 <= 240)
            printf("YES\n");
        else printf("NO\n");
    }

    return 0;
}

转载于:https://www.cnblogs.com/Sunshine-tcf/p/5745664.html