CodeforcesRound#256(Div.2)A.Rewards_html/css

time limit per test

memory limit per test

input

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:

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"); }}

??

声明：本网页内容旨在传播知识，若有侵权等问题请及时与本网联系，我们将在第一时间删除处理。TEL:177 7030 7066 E-MAIL:11247931@qq.com