B. Ciel and Flowers

最新推荐文章于 2022-05-26 17:00:30 发布

原创最新推荐文章于 2022-05-26 17:00:30 发布 · 296 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 3 个专栏收录

359 篇文章

订阅专栏

codeforces

194 篇文章

订阅专栏

暴力

11 篇文章

订阅专栏

这篇博客介绍了如何帮助Ciel用红色、绿色和蓝色的花朵来制作四种不同类型的花束，包括红色、绿色、蓝色和混合花束，以求最大化制作的花束数量。问题通过输入花朵的数量来求解能制作的最大花束数。

链接：https://codeforces.com/problemset/problem/322/B

Fox Ciel has some flowers: r red flowers, g green flowers and b blue flowers. She wants to use these flowers to make several bouquets. There are 4 types of bouquets:

To make a "red bouquet", it needs 3 red flowers.
To make a "green bouquet", it needs 3 green flowers.
To make a "blue bouquet", it needs 3 blue flowers.
To make a "mixing bouquet", it needs 1 red, 1 green and 1 blue flower.

Help Fox Ciel to find the maximal number of bouquets she can make.

Input

The first line contains three integers r, g and b (0 ≤ r, g, b ≤ 109) — the number of red, green and blue flowers.

Output

Print the maximal number of bouquets Fox Ciel can make.

Examples

input

Copy

3 6 9

output

Copy

input

Copy

4 4 4

output

Copy

input

Copy

0 0 0

output

Copy

Note

In test case 1, we can make 1 red bouquet, 2 green bouquets and 3 blue bouquets.

In test case 2, we can make 1 red, 1 green, 1 blue and 1 mixing bouquet.

代码：

#include<bits/stdc++.h>
using namespace std;
long long n,m,t,k,s,d,max1=0,a,b,c,mod=1e9+7;
long long x[10];
main()
{
	cin>>a>>b>>c;
	x[1]=a/3+b/3+c/3+min(a%3,min(b%3,c%3));
	x[2]=(a-1)/3+(b-1)/3+(c-1)/3+min((a-1)%3,min((b-1)%3,(c-1)%3))+1;
	x[3]=(a-2)/3+(b-2)/3+(c-2)/3+min((a-2)%3,min((b-2)%3,(c-2)%3))+2; 
	cout<<max(x[1],max(x[3],x[2]));
}