How to solve this digit DP question?

Правка en1, от hydro_lyte, 2019-10-23 14:21:56

The question is- We are given two integers L and R. We are required to determine the count of special numbers ranging in between L and R. If the binary representation of X contains a pattern 101, then X is called special number. Constraints- 1 ≤ L ≤ R ≤ 10^18

Теги digit dp, #dp, #dynamic programing

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский hydro_lyte 2019-10-23 14:22:56 75
en1 Английский hydro_lyte 2019-10-23 14:21:56 297 Initial revision (published)