Codeforces Round 190 (Div. 2)
B
Ciel and Flowers
Codeforces
1600
原题
← AC →
翻译中…

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* ≤ 10^{9}$) — the number of red, green and blue flowers.

翻译中…

Output

翻译中…

Print the maximal number of bouquets Fox Ciel can make.

翻译中…

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.

翻译中…

样例

Input #1
3 6 9
Output #1
6
InputCopy OutputCopy
Input #2
4 4 4
Output #2
4
InputCopy OutputCopy
Input #3
0 0 0
Output #3
0
InputCopy OutputCopy
题目信息
题号
322B
时间限制
1 s
内存限制
256 MB
标签
组合数学
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。