[BOJ 15151] Incomplete Book

View as PDF

Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 512M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

Meorge Arr Arr Gartin, the pirate, is currently writing a series of amazing novels. Full of inspiration, his first novel only took him k days to write. However, as time went on, he started writing slower and slower. In particular, if it took him ℓ days to write the ith book in the series, then it will take him 2ℓ days to write the (i + 1)th book.</p>

Because of how slow he is writing the series, fans are worried that he will not be around long enough to finish the series before he dies. What is the maximum number of books that he can finish before he dies?

입력 형식

The input consists of a single line containing two integers k (1 ≤ k ≤ 365), which is the number of days needed to write the first book, and d (k ≤ d ≤ 109), which is the number of days after he started writing the first book that he will die.

출력 형식

Display the maximum number of books that he can finish.

예제 입력 1

1 1

예제 출력 1

1

예제 입력 2

1 2

예제 출력 2

1

예제 입력 3

1 3

예제 출력 3

2

예제 입력 4

117 1337

예제 출력 4

3

Comments

There are no comments at the moment.