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 anda3 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.
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 1
1 1 1
4
YES
1 1 3
2 3 4
2
YES
1 0 0
1 0 0
1
NO
#include <iostream> #include <cstdio> using namespace std; int main() { int a1,a2,a3,b1,b2,b3,n; while(scanf("%d%d%d%d%d%d",&a1,&a2,&a3,&b1,&b2,&b3)!=-1) { cin>>n; int a,b,sum; sum=0; a=a1+a2+a3; b=b1+b2+b3; if(a%5==0) sum+=a/5; else sum+=a/5+1; if(b%10==0) sum+=b/10; else sum+=b/10+1; if(sum<=n) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }
Codeforces Round #256 (Div. 2) A Rewards
原文：http://www.cnblogs.com/nefu929831238/p/5915707.html