> 웹 프론트엔드 > HTML 튜토리얼 > Codeforces Round #256 (Div. 2) A. Rewards_html/css_WEB-ITnose

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

WBOY
풀어 주다: 2016-06-24 12:01:40
원래의
1152명이 탐색했습니다.

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");    }}
    로그인 후 복사

    ??

    관련 라벨:
    원천:php.cn
    본 웹사이트의 성명
    본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
    인기 튜토리얼
    더>
    최신 다운로드
    더>
    웹 효과
    웹사이트 소스 코드
    웹사이트 자료
    프론트엔드 템플릿