cf386 div2 A. Compote
来源:互联网 发布:渡边梨加 知乎 编辑:程序博客网 时间:2024/06/05 01:07
A. Compote
time limit per test
memory limit per test
input
output
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.
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
257
Output
7
Input
4713
Output
21
Input
232
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 <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){ int a, b, c; cin >> a >> b >> c; int sum1 = a / 1; int sum2 = b / 2; int sum3 = c / 4; cout << min(min(sum1, sum2), sum3) * 7 << endl; return 0;}
- cf386 div2 A. Compote
- A. Compote
- 746 A. Compote codeforces
- 【codeforces 746A】Compote
- codeforces 746A Compote
- 【78.89%】【codeforces 746A】Compote
- codeforces 746 A.Compote【水题】
- codeforces#386A 746A Compote
- Codeforces Round #386 (Div. 2) A. Compote
- Codeforces Round #386 (Div. 2) 746A Compote
- codeforces 105 div2 A
- codeforces 145 div2 A
- cf192 div2 A. Cakeminator
- cf div2 191 A
- cf 185div2 A
- Codeforcese #263 Div2 A
- CF 287 div2 A
- SRM 633 DIV2 A
- 【详解】为什么选择Spring Boot作为微服务的入门级微框架
- 2017网页设计趋势
- innodb 获取行锁争用情况
- ReentrantLock笔记
- caffe源码解析by薛云峰
- cf386 div2 A. Compote
- TOP中只查看某个或某些进程的信息
- 搭建 hadoop HA
- 2016.12.18 总结周日
- Ubuntu终端常用命令
- Codeforces Round #386 (Div. 2)
- Android开发中ListView图片加载的优化机制
- APP广告相关随笔
- 如何优化SQL查询语句?