Description
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 Input
1 1 1 1 1 1 4
YES
1 1 3 2 3 4 2
YES
1 0 0 1 0 0 1
NO
题意:
一个人头金牌银牌铜牌,金杯银杯铜杯。
有N个架子。
每个架子可以最多放五个杯或者10个牌。
并且一个架子不能同时放杯和牌。
给定N
问是否放得下。
直接模拟。
四种情况讨论就好了。
#include <stdio.h> #include <math.h> #include <string.h> #include <algorithm> using namespace std; #include <queue> #include <stack> int main() { int n,a1,a2,a3,b1,b2,b3,sum1,sum2,c; while(scanf("%d%d%d%d%d%d",&a1,&a2,&a3,&b1,&b2,&b3)!=EOF) { scanf("%d",&n); sum1=a1+a2+a3; sum2=b1+b2+b3; if(sum1%5!=0 &&sum2%10!=0) c=sum1/5+1+sum2/10+1; else if(sum1%5==0 &&sum2%10!=0) c=sum1/5+sum2/10+1; else if(sum1%5!=0 &&sum2%10==0) c=sum1/5+sum2/10+1; else if(sum1%5==0 &&sum2%10==0) c=sum1/5+sum2/10; //printf("%d %d %d\n",sum1,sum2,c); if(c>n) printf("NO\n"); else printf("YES\n"); } return 0; }