Question 2
A country has $25$ cities. Determine the smallest integer $k$ for which two-way direct air routes can be established satisfying both conditions:
1. Every city has direct routes to exactly $k$ other cities.
2. Whenever two cities have no direct route between them, there is at least one city having direct routes to both.
The supplied source has no question point values. Each problem uses 1 editorial point for import compatibility; this is not an official scoring scale.
1. Every city has direct routes to exactly $k$ other cities.
2. Whenever two cities have no direct route between them, there is at least one city having direct routes to both.
The supplied source has no question point values. Each problem uses 1 editorial point for import compatibility; this is not an official scoring scale.