MathDB

There are two-way flights between some of the

2017

cities in a country, such that given two cities, it is possible to reach one from the other. No matter how the flights are appointed, one can define

k

cities as "special city", so that there is a direct flight from each city to at least one "special city". Find the minimum value of

k

Problem Statement