Codeforces Round #256 (Div. 2) A. Rewards

最新推荐文章于 2019-03-02 00:24:00 发布

AnICoo1

最新推荐文章于 2019-03-02 00:24:00 发布

阅读量371

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/helloiamclh/article/details/50670808

版权

水题专栏收录该内容

104 篇文章 0 订阅

订阅专栏

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 a₁ first prize cups, a₂ second prize cups and a₃ third prize cups. Besides, he has b₁ first prize medals, b₂ second prize medals and b₃ 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 a₁, a₂ and a₃ (0 ≤ a₁, a₂, a₃ ≤ 100). The second line contains integers b₁, b₂ and b₃ (0 ≤ b₁, b₂, b₃ ≤ 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


题意：a有三种东西，b有三种东西，a种类装的箱子最多装5个，b种类装的箱子最多装10个，共有n个箱子，问是否能
全部装完

思路：水题，直接写吧

ac代码：
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
LL gcd(LL a,LL b){return b?gcd(b,a%b):a;}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
//head
int main()
{
	int a1,a2,a3,b1,b2,b3,n;
	while(scanf("%d%d%d%d%d%d%d",&a1,&a2,&a3,&b1,&b2,&b3,&n)!=EOF)
	{
		int ans=(a1+a2+a3)/5+(b1+b2+b3)/10;
		if((a1+a2+a3)%5)
		ans++;
		if((b1+b2+b3)%10)
		ans++;
		if(ans>n)
		printf("NO\n");
		else
		printf("YES\n");
	}
	return 0;
}