AtCoder Beginner Contest 076
翻译中…
Problem Statement
翻译中…
Square1001 has seen an electric bulletin board displaying the integer $1$. He can perform the following operations A and B to change this value:
翻译中…
- Operation A: The displayed value is doubled.
- Operation B: The displayed value increases by
$K$.
翻译中…
Square1001 needs to perform these operations $N$ times in total. Find the minimum possible value displayed in the board after $N$ operations.
翻译中…
Constraints
翻译中…
$1 \leq N, K \leq 10$- All input values are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
K翻译中…
Output
翻译中…
Print the minimum possible value displayed in the board after $N$ operations.
翻译中…
样例
Input #1
4
3
Output #1
10
The value will be minimized when the operations are performed in the following order: A, A, B, B.
In this case, the value will change as follows: $1$ → $2$ → $4$ → $7$ → $10$.
Input #2
10
10
Output #2
76
The value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.
In this case, the value will change as follows: $1$ → $2$ → $4$ → $8$ → $16$ → $26$ → $36$ → $46$ → $56$ → $66$ → $76$.
By the way, this contest is AtCoder Beginner Contest 076.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。