CodeForces 448-A. Rewards
来源:互联网 发布:苏州大学网络缴费平台 编辑:程序博客网 时间:2024/04/29 14:53
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 a3third 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.
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.
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).
1 1 11 1 14
YES
1 1 32 3 42
YES
1 0 01 0 01
NO
#include<stdio.h>#include<algorithm>using namespace std;int main(){ int a1,a2,a3,b1,b2,b3,n; scanf("%d%d%d",&a1,&a2,&a3); scanf("%d%d%d",&b1,&b2,&b3); scanf("%d",&n); int sum1 = a1+a2+a3; int sum2 = b1+b2+b3; int temp1 = (sum1%5==0?(sum1/5):(sum1/5+1)); int temp2 = (sum2%10==0?(sum2/10):(sum2/10+1)); if(temp1+temp2>n) printf("NO\n"); else printf("YES\n"); return 0;}
- codeforces-448A-Rewards
- Codeforces 448A Rewards
- CodeForces 448-A. Rewards
- CodeForces 448A Rewards
- codeforces 448 A. Rewards
- codeforces #256 A. Rewards
- codeforces—— 448A —— Rewards
- 448A - Rewards
- Codeforces Round #256 (Div. 2) A. Rewards
- Codeforces Div. 2 #256-A. Rewards
- Codeforces Round #256 (Div. 2) A. Rewards
- Codeforces Round #256 (Div. 2) A. Rewards
- A. Rewards
- Codeforces Round #256 (Div. 2) A. Rewards(简单题)
- Rewards - #256 (Div. 2) A (448A)水题
- CF (Round#256) A. Rewards
- CF#256(Div.2) A. Rewards
- Discover the Rewards of Owning A CNC Router
- toj2010 Sum of Consecutive Prime Numbers
- git ssh-keygen Fingerprint cannot be generated
- Android不显示SDK图标的解决
- JVM-程序运行原理
- 电子邮件内容与自己性格不一致的人们(好玩的心理学知识)
- CodeForces 448-A. Rewards
- HDU 题目1106 排序
- Semaphore 和 Mutex
- CodeForces 448-B. Suffix Structures
- 在这人人躲在厕所斗地主的时代下页游平台如何绝地重生?
- Linux 在一个命令行上执行多个命令
- bootstrap3.0关于button方法的attempted to call method 'loading'问题
- Android之 ANR
- CodeForces 448-C. Painting Fence