flights, rootes and two mins
Source: JBMO Shortlist 2014 C2
April 24, 2019
combinatoricsminimum valueminimum
Problem Statement
In a country with towns, all the direct flights are of double destinations (back and forth). There are rootes between different pairs of towns, that include no more than one intermediate stop (direction of each root matters). Find the minimum possible value of and the minimum possible for that value of .