https://atcoder.jp/contests/abc141/tasks/abc141_fIf the number of ones on i-th bit is odd, 2^i is always added to the answer no matter how we classified them. Therefore, we can use an usual approach for finding lexicographically maximum. W…

https://codeforces.com/contest/1209/problem/FSuppose that we already understand the official editorial. Official solution is really simple but I didn't come up with this algorithm without reading it. Instead, I will explain another way to …