AtCoder Beginner Contest 096
翻译中…
Problem Statement
翻译中…
There are three positive integers $A$, $B$ and $C$ written on a blackboard. E869120 performs the following operation $K$ times:
翻译中…
- Choose one integer written on the blackboard and let the chosen integer be
$n$. Replace the chosen integer with$2n$.
翻译中…
What is the largest possible sum of the integers written on the blackboard after $K$ operations?
翻译中…
Constraints
翻译中…
$A, B$and$C$are integers between$1$and$50$(inclusive).$K$is an integer between$1$and$10$(inclusive).
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
A B C
K翻译中…
Output
翻译中…
Print the largest possible sum of the integers written on the blackboard after $K$ operations by E869220.
翻译中…
样例
Input #1
5 3 11
1
Output #1
30
In this sample, $5, 3, 11$ are initially written on the blackboard, and E869120 can perform the operation once.
There are three choices:
1. Double $5$: The integers written on the board after the operation are $10, 3, 11$.
2. Double $3$: The integers written on the board after the operation are $5, 6, 11$.
3. Double $11$: The integers written on the board after the operation are $5, 3, 22$.
If he chooses 3., the sum of the integers written on the board afterwards is $5 + 3 + 22 = 30$, which is the largest among 1. through 3.
Input #2
3 3 4
2
Output #2
22
E869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:
- First, double $4$. The integers written on the board are now $3, 3, 8$.
- Next, double $8$. The integers written on the board are now $3, 3, 16$.
Then, the sum of the integers eventually written on the blackboard is $3 + 3 + 16 = 22$.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。