title: c++ bitset logical operations in O(log n)?
body: <p>According to this post <a href="https://stackoverflow.com/questions/9561579/performance-of-doing-bitwise-operations-on-bitsets">Performance of doing bitwise operations on bitsets</a> performance is O(n) how do I make it O(log n).
  Thanks. </p>