| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
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
We have to print the total count of special numbers in the range [L,R]
Use the same DP that you use for digit DP, and add two extra states: one to represent if this pattern has occurred in the binary representation so far (0 or 1), and the second to represent the size of the prefix of the pattern that is currently matching (0, 1, 2, or 3).