题目链接：http://codeforces.com/contest/448/problem/A
A. Rewards
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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 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.
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 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
代码例如以下：
#include <stdio.h>
int main()
{
int n, a[4],b[4];
int sum1,sum2;
int t1,t2;
while(scanf("%d%d%d",&a[1],&a[2],&a[3])!=EOF)
{
sum1=sum2=0;
sum1+=a[1],sum1+=a[2],sum1+=a[3];
scanf("%d%d%d",&b[1],&b[2],&b[3]);
sum2+=b[1],sum2+=b[2],sum2+=b[3];
scanf("%d",&n);
if(sum1%5 != 0)
{
t1 = sum1/5+1;
}
else
t1 = sum1/5;
if(sum2%10 != 0)
{
t2 = sum2/10+1;
}
else
t2 = sum2/10;
if(t1+t2 <= n)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
