The Coder

The heading has to do nothing with the main problem. A Weighted graph with positive integer weights on N vertices is given an integer N and an array C of positive integers of size N. There is a weighted graph with positive integer weights on N vertices such that the sum of edge weights adjacent to vertex I is C[i] and the edge weight between I and j is at most I bitwise-xor j Input First lin