zoukankan      html  css  js  c++  java
  • cf448A Rewards

    A. Rewards
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Bizon the Champion is called the Champion for a reason.

    Bizon the Champion has recently got a present — a new glass cupboard with n shelves and he decided to put all his presents there. All the presents can be divided into two types: medals and cups. Bizon the Champion has a1 first prize cups, a2 second prize cups and a3third prize cups. Besides, he has b1 first prize medals, b2 second prize medals and b3 third prize medals.

    Naturally, the rewards in the cupboard must look good, that's why Bizon the Champion decided to follow the rules:

    • any shelf cannot contain both cups and medals at the same time;
    • no shelf can contain more than five cups;
    • no shelf can have more than ten medals.

    Help Bizon the Champion find out if we can put all the rewards so that all the conditions are fulfilled.

    Input

    The first line contains integers a1a2 and a3 (0 ≤ a1, a2, a3 ≤ 100). The second line contains integers b1b2 and b3 (0 ≤ b1, b2, b3 ≤ 100). The third line contains integer n (1 ≤ n ≤ 100).

    The numbers in the lines are separated by single spaces.

    Output

    Print "YES" (without the quotes) if all the rewards can be put on the shelves in the described manner. Otherwise, print "NO" (without the quotes).

    Sample test(s)
    input
    1 1 1
    1 1 1
    4
    
    output
    YES
    
    input
    1 1 3
    2 3 4
    2
    
    output
    YES
    
    input
    1 0 0
    1 0 0
    1
    
    output
    NO

    额……好久没刷cf了

    第一题模拟一下

    #include<cstdio>
    #define LL long long 
    using namespace std;
    inline int read()
    {
        int x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
        while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
        return x*f;
    }
    LL a,b,c,d,e,f,g,h,n;
    int main()
    {
        scanf("%lld%lld%lld%lld%lld%lld",&a,&b,&c,&d,&e,&f);
        g=a+b+c;
        h=d+e+f;
        scanf("%lld",&n);
        if (g%5)n--;
        if (h%10)n--;
        if (g/5+h/10<=n) printf("YES");
        else printf("NO");
        return 0;
    }
    
    ——by zhber,转载请注明来源
  • 相关阅读:
    MDK(keil)4.7中文注释乱码解决
    小型功率放大器的设计与制作
    增强输出的电路
    晶体管电路设计学习笔记(一)
    MOSFET学习
    sysTick系统定时器
    C#面向对象 什么是面向对象
    JS基础 超链接、数列的用法,行内元素和块级元素
    JS基础 常用函数、事件、阻止事件冒泡
    JS基础 定时器【setTimeout、setInterval、clearInterval 】
  • 原文地址:https://www.cnblogs.com/zhber/p/4036047.html
Copyright © 2011-2022 走看看