How may I perform such operation on bitset, taking advantage of bitset speedup?
It is quite frustrating because such a thing is trivial to implement for a bitset, but designer of std::bitset interface does not allow so.
# | 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 | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
How may I perform such operation on bitset, taking advantage of bitset speedup?
It is quite frustrating because such a thing is trivial to implement for a bitset, but designer of std::bitset interface does not allow so.
Name |
---|
Auto comment: topic has been updated by nonrice (previous revision, new revision, compare).
https://codeforces.me/blog/entry/43718
There is no
_Find_last()
function, you should've mentioned that.There are a lot of potentially useful stuff that are not implemented in bitset, that's a life. Just write your own implementation, it's not that hard. Would take several hours and a few hundred lines of code thought, but worth it.
Although counting leading zeros is actually possible by using function
_Find_first()
which finds position of first set bit which equals to number of leading zeroes. But there is no_Find_last()
function though.Yes, in the end I simply wrote my own.
If you have a structured settlement and you need cash now, you should call JG Wentworth 877-CASH-NOW!