[UVA][greedy] 12545 - Bits Equalizer
You are given two non-empty strings S and T of equal lengths. S contains the characters `0', `1' and `?', whereas T contains `0' and `1' only. Your task is to convert S into T in minimum number of moves. In each move, you can change a `0' in S to `1' change a `?' in S to `0' or ...
