2015 Team #10
Source:
August 3, 2022
2015team test
Problem Statement
An ant is walking on the edges of an icosahedron of side length . Compute the length of the longest path that the ant can take if it never travels over the same edge twice, but is allowed to revisit vertices.