Logo
(追記) (追記ここまで)

15151번 - Incomplete Book 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 512 MB69052248577.849%

문제

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 l days to write the ith book in the series, then it will take him 2l days to write the (i + 1)th book.

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

힌트

출처

ICPC > Regionals > South Pacific > South Pacific Region > ACM ICPC South Pacific Divisionals > 2017 South Pacific Divisional Contest I번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /