题库练习 Compote
← 上一题 下一题 →

A10733 | Compote

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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 ratio $1: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$ .

输入格式

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.

输出格式

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

输入输出样例

输入 #1
2
5
7
输出 #1
7
输入 #2
4
7
13
输出 #2
21
输入 #3
2
3
2
输出 #3
0
C++ 编辑器
输入
输出