测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A10733. Compote

编程题 普及/提高-

题目描述

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

说明/提示

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$ .
上一题 去做题 下一题