Can anyone suggest me a way to find the previous set bit or next set bit using Bitset STL in C++? I have seen submissions in Java where these functions are pre-defined. Any way to do the same in C++?
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Can anyone suggest me a way to find the previous set bit or next set bit using Bitset STL in C++? I have seen submissions in Java where these functions are pre-defined. Any way to do the same in C++?
Name |
---|
Auto comment: topic has been updated by subash23 (previous revision, new revision, compare).
https://codeforces.net/blog/entry/43718
Thanks. Is there any function like Find_prev()?
I couldn't find anything online, so not sure but probably not
Implement it. Bitset problems are often time-critical enough that it's better to write something that works fast for a specific case.