olymmath

HMMT November 2010 F1

  • General 2
  • Answer

16 progamers are playing in a single elimination tournament. Each player has a different skill level and when two play against each other the one with the higher skill level will always win. Each round, each progamer plays a match against another and the loser is eliminated. This continues until only one remains. How many different progamers can reach the round that has 2 players remaining?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

9

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 hmnt/2010/f1 · Tag W28VKW5MHP · Edit this page on GitHub · Keys: j next, k previous