This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 801

2004 All-Russian Olympiad, 2
Tags: graph theory , combinatorics
A country has 1001 cities, and each two cities are connected by a one-way street. From each city exactly 500 roads begin, and in each city 500 roads end. Now an independent republic splits itself off the country, which contains 668 of the 1001 cities. Prove that one can reach every other city of the republic from each city of this republic without being forced to leave the republic.