olymmath

KURSCHAK 1980 Problem 3

    In a certain country there are two tennis clubs consisting of 10001000 and 10011001 members respectively. All the members have different playing strength, and the descending order of palying strengths in each club is known. Find a procedure which determines, within 1111 games, who is in the 10011001 st place among the 20012001 players in these clubs. It is assumed that a stronger player always beats a weaker one.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator kurschak/1980/p3 · Tag X6DBZJB645 · Edit this page on GitHub · Keys: j next, k previous