Given a set of unsigned integers. How can I find the bit-permutation so that the maximum number is minimal?
-
Take all the one bits and store them breadth first starting from lsb. Maximum is 2^(ceil(onebits/integers)+1)-1 I think
What is a "one bit"? A position where there is at least one bit set? So what if there are 0s and 1s at each position? See also this tweet:https://twitter.com/oe1cxw/status/1119255354829832194 …
-
-
Ah, I misunderstood the problem. You want to apply the same permutation to all integers. The other case is more trivial. I'll think about it a bit more.
-
Obviously start with msb zero columns, then take the column with the least ones. The one rows are the "danger set", pick the column with the least ones in the danger set. Intersect the danger set and repeat. At every column, everything outside the danger set is lower.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.