P2951 [USACO09OPEN] Hide and Seek S

Bessie is playing hide and seek (a game in which a number of players hide and a single player (the seeker) attempts to find them after which various penalties and rewards are assessed; much fun usually ensues). She is trying to figure out in which of N (2

* Line 1: Two space-separated integers: N and M * Lines 2..M+1: Line i+1 contains the endpoints for path i: A_i and B_i

* Line 1: On a single line, print three space-separated integers: the index of the barn farthest from barn 1 (if there are multiple such barns, print the smallest such index), the smallest number of paths needed to reach this barn from barn 1, and the number of barns with this number of paths.

The farm layout is as follows: 1--2--5 | /| |/ | 3--4 | 6 Barns 4, 5, and 6 are all a distance of 2 from barn 1. We choose barn 4 because it has the smallest index.