- Problem Statement.
- A
**main()**with the examples compiled in. - A skeleton that compiles with
**main.cpp**. -
**Problem Given in Topcoder**: March, 2016 -
**Competitors who opened the problem**: 382 -
**Competitors who submitted a solution**: 326 -
**Number of correct solutions**: 275 -
**Accuracy (percentage correct vs those who opened)**: 72.0% -
**Average Correct Time**: 18 minutes, 2 seconds.

Maintain a vector **E** so that **E[i]** contains the number of edges coming out of
node *i*. Run through each edge, and add one to the **E** value of the nodes on
each side of the edge.

Then calculate the maximum.

Solution