#AT1167. C - Multiple Gift
C - Multiple Gift
当前没有测试数据。
C - Multiple Gift
Score : $300$ points
Problem Statement
As a token of his gratitude, Takahashi has decided to give his mother an integer sequence. The sequence $A$ needs to satisfy the conditions below:
- $A$ consists of integers between $X$ and $Y$ (inclusive).
- For each $1\leq i \leq |A|-1$, $A_{i+1}$ is a multiple of $A_i$ and strictly greater than $A_i$.
Find the maximum possible length of the sequence.
Constraints
- $1 \leq X \leq Y \leq 10^{18}$
- All input values are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the maximum possible length of the sequence.
3 20
3
The sequence $3,6,18$ satisfies the conditions.
25 100
3
314159265 358979323846264338
31