There’s an interesting data structure called the sqrt-tree (you can read about it here). I’ve searched everywhere but couldn’t find an implementation that supports range update queries. I would be very grateful if anyone could share their code.

Is it possible to answer these queries using bitwise Gaussian Elimination in $$$O(\log{}(maxn))$$$ complexity?

• $$$add(x)$$$ — Add number $$$x$$$ to set $$$S$$$.
• $$$order(x)$$$ — Let, $$$X$$$ denote the sorted set of all possible xor-sums of elements from a subset of $$$S$$$. Find a maximum $$$k$$$ such that $$$x\ \ge\ k$$$-th element in $$$X$$$.

I always had trouble choosing a font and a week after I found some good font I wanted to change it again. Please recommend some good monospace fonts.