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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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://mirror.codeforces.com/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.