codeforces 746 A.Compote【水题】

最新推荐文章于 2020-02-29 17:33:37 发布

原创最新推荐文章于 2020-02-29 17:33:37 发布 · 966 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #水题

CodeForces 同时被 2 个专栏收录

57 篇文章

订阅专栏

-> 水题 <-

34 篇文章

订阅专栏

本文介绍了一个简单的算法问题，即如何根据给定数量的柠檬、苹果和梨，按照1:2:4的比例制作水果拼盘，使得使用的水果总数最多。文章通过示例解释了问题背景，并提供了一段C++代码实现。

Nikolay has a lemons, b apples and c pears. He decided to cook a compote. According to the recipe the fruits should be in the ratio1: 2: 4. It means that for each lemon in the compote should be exactly 2 apples and exactly 4 pears. You can't crumble up, break up or cut these fruits into pieces. These fruits — lemons, apples and pears — should be put in the compote as whole fruits.

Your task is to determine the maximum total number of lemons, apples and pears from which Nikolay can cook the compote. It is possible that Nikolay can't use any fruits, in this case print 0.

Input

The first line contains the positive integer a (1 ≤ a ≤ 1000) — the number of lemons Nikolay has.

The second line contains the positive integer b (1 ≤ b ≤ 1000) — the number of apples Nikolay has.

The third line contains the positive integer c (1 ≤ c ≤ 1000) — the number of pears Nikolay has.

Output

Print the maximum total number of lemons, apples and pears from which Nikolay can cook the compote.

Examples

input
2
5
7

output
7

input
4
7
13

output
21

input
2
3
2

output
0

Note

In the first example Nikolay can use 1 lemon, 2 apples and 4 pears, so the answer is 1 + 2 + 4 = 7.

In the second example Nikolay can use 3 lemons, 6 apples and 12 pears, so the answer is 3 + 6 + 12 = 21.

In the third example Nikolay don't have enough pears to cook any compote, so the answer is 0.

/*
    题意：给定柠檬a个,苹果b个,梨子c个,按照1：2：4的比例拼成果盘,问最多能用掉几个水果
    类型：水题
    分析：直接写
*/
#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;

int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    for(int i=a;i>=0;i--){
        if(2*i<=b&&4*i<=c){
            printf("%d\n",i+2*i+4*i);
            break;
        }
    }
    return 0;
}