AtCoder Beginner Contest 180
D
Takahashi Unevolved
AtCoder
⌀ 752
原题
← CE →
翻译中…

Problem Statement

翻译中…

Iroha is into a game where you keep pets.

翻译中…

Iroha's pet is Takahashi. Initially, Takahashi's STR and EXP are $X$ and $0$, respectively. These parameters increase in the following two kinds of training:

翻译中…
  • Go to Kakomon Gym: the STR gets multiplied by $A$, and the EXP increases by $1$.
  • Go to AtCoder Gym: the STR increases by $B$, and the EXP increases by $1$.
翻译中…

Takahashi evolves when his STR becomes $Y$ or greater, but Iroha thinks that makes him less cute.

翻译中…

Find the maximum possible EXP of Takahashi when he is trained without letting him evolve.

翻译中…

Constraints

翻译中…
  • $1 \leq X < Y \leq 10^{18}$
  • $2 \leq A \leq 10^9$
  • $1 \leq B \leq 10^9$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

X Y A B

翻译中…

Output

翻译中…

Print the maximum possible EXP of Takahashi under the given situation.

翻译中…

样例

Input #1
4 20 2 10
Output #1
2
Initially, Takahashi's STR is $4$. We can make his EXP $2$ in the following course of training: - First, go to Kakomon Gym, which makes his STR $8$ and his EXP $1$. - Then, go to AtCoder Gym, which makes his STR $18$ and his EXP $2$. On the other hand, there is no way to train him so that his EXP becomes greater than $2$.
Input #2
1 1000000000000000000 10 1000000000
Output #2
1000000007
Watch out for overflows.
题目信息
题号
abc180_d
时间限制
2 s
内存限制
1024 MB

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