Rumah > hujung hadapan web > html tutorial > Codeforces Round #256 (Div. 2) A. Rewards_html/css_WEB-ITnose

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

WBOY
Lepaskan: 2016-06-24 12:01:40
asal
1157 orang telah melayarinya

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
    Salin selepas log masuk

    Output

    YES
    Salin selepas log masuk
    Salin selepas log masuk

    Input

    1 1 32 3 42
    Salin selepas log masuk

    Output

    YES
    Salin selepas log masuk
    Salin selepas log masuk

    Input

    1 0 01 0 01
    Salin selepas log masuk

    Output

    NO
    Salin selepas log masuk

    题意:一种是奖杯一种是奖牌放架子上,一层能放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");    }}
    Salin selepas log masuk

    ??

    Label berkaitan:
    sumber:php.cn
    Kenyataan Laman Web ini
    Kandungan artikel ini disumbangkan secara sukarela oleh netizen, dan hak cipta adalah milik pengarang asal. Laman web ini tidak memikul tanggungjawab undang-undang yang sepadan. Jika anda menemui sebarang kandungan yang disyaki plagiarisme atau pelanggaran, sila hubungi admin@php.cn
    Tutorial Popular
    Lagi>
    Muat turun terkini
    Lagi>
    kesan web
    Kod sumber laman web
    Bahan laman web
    Templat hujung hadapan