BasicCountingPrinciple USAMO
2015


Problem - 2201
In the diagram below, how many different routes are there from point $M$ to point $P$ using only the ling segments shown? A route is not allowed to intersect itself, not even at a single point.


report an error