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 | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
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.