I was trying this problem: Boboniu and Bit Operations ( https://mirror.codeforces.com/problemset/problem/1395/C ) and in the solution, it suggested finding the answer by brute force that tries all 2^9 numbers. My doubt is, how come just choosing the minimum and of ai and bj not optimal? My solution: https://mirror.codeforces.com/contest/1395/submission/109813483 (My approach). Please if someone could help, it would be very much appreciated.