传送门 题目描述 Now given two integers x and y, you can reverse every consecutive three bits ,,) means changing it into (,,). Could you please find a way that minimize number of coins so that x = y? If you can, just output the minimum coins you need to use.…