olymmath

HMMT November 2009 U31

  • Guts
  • Answer

There are two buildings facing each other, each 5 stories high. How many ways can Kevin string ziplines between the buildings so that: (a) each zipline starts and ends in the middle of a floor. (b) ziplines can go up, stay flat, or go down, but can't touch each other (this includes touching at their endpoints).

Note that you can't string a zipline between two floors of the same building.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

252

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/2009/u31 · Tag CXP426T6NA · Edit this page on GitHub · Keys: j next, k previous