MathDB
Turkey NMO 2010 P1

Source:

December 15, 2010
ceiling functioncombinatorics proposedcombinatorics

Problem Statement

In a country, there are some two-way roads between the cities. There are 20102010 roads connected to the capital city. For all cities different from the capital city, there are less than 20102010 roads connected to that city. For two cities, if there are the same number of roads connected to these cities, then this number is even. kk roads connected to the capital city will be deleted. It is wanted that whatever the road network is, if we can reach from one city to another at the beginning, then we can reach after the deleting process also. Find the maximum value of k.k.