首页 / HTML / CodeforcesRound#256(Div.2)A.Rewards_html/css_WEB-ITnose

CodeforcesRound#256(Div.2)A.Rewards_html/css_WEB-ITnose

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#256(Div.2)A.Rewards_html/css_WEB-ITnose，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含2540字，纯文字阅读大概需要4分钟。

内容图文

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 a3 third 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 a1, a2 and a3 (0?≤?a1,?a2,?a3?≤?100). The second line contains integers b1, b2 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 11 1 14

    Output 

    YES

    Input 

    1 1 32 3 42

    Output 

    YES

    Input 

    1 0 01 0 01

    Output 

    NO

    题意：一种是奖杯一种是奖牌放架子上，一层能放5个奖杯，或者10个奖牌，一层不能有两种，水题。

    AC代码：

    import java.util.*;public class Main {    public static void main(String[] args) {        Scanner scan=new Scanner(System.in);        int a1=scan.nextInt(),a2=scan.nextInt(),a3=scan.nextInt();        int b1=scan.nextInt(),b2=scan.nextInt(),b3=scan.nextInt();        int n=scan.nextInt();        int sum1,sum2;        sum1=a1+a2+a3;        sum2=b1+b2+b3;        int count=0;        if(sum1%5==0){            count+=sum1/5;        }        else            count+=sum1/5+1;        if(sum2%10==0){            count+=sum2/10;        }        else            count+=sum2/10+1;        if(count>n)            System.out.println("NO");        else            System.out.println("YES");    }}

    ??

    内容总结

    以上是互联网集市为您收集整理的CodeforcesRound#256(Div.2)A.Rewards_html/css_WEB-ITnose全部内容，希望文章能够帮你解决CodeforcesRound#256(Div.2)A.Rewards_html/css_WEB-ITnose所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

    内容备注

    版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

    内容手机端

    扫描二维码推送至手机访问。

    本文链接：https://qyyshop.com/info/398293.html

    来源：【匿名】