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

A. Rewards

time limit per test1 second

memory limit per test256 megabytes

inputstandard input

outputstandard 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
給出兩種獎盃的數量  要將它們全部放在書架上要求同一個書架不能同時放兩種不同的獎盃  一個書架不能同時放5個以上（可以放五個）a類獎盃  或10個b類獎盃   

模擬水題

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int n,m,a1,a2,a3,b1,b2,b3;
    while(cin>>a1>>a2>>a3>>b1>>b2>>b3)
    {
        int k;
        cin>>n;
        m=a1+a2+a3;
        k=b1+b2+b3;
        if(m%5>0)
            m=m/5+1;
            else
                m=m/5;
        if(k%10>0)
            k=k/10+1;

            else
                k=k/10;
        if(n>=k+m)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}