Choose a simple path and a non-negative integer x, then for each edge e that belongs to the path, change ae by executing ae←ae⊕x (⊕ denotes XOR). Your objective is to have ae=0 for all edges e. Find the minimum number of operations required to achieve it. 回到顶部 Constraints ...