Editorial for DMOPC '14 Contest 6 P5 - Planning


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Phoenix1369

With Hankel determinants of the large and small Schröder numbers, you can obtain a bijection between non-intersecting lattice paths and number of subway maps. The implementation is therefore left as an exercise to the reader.

Time Complexity: \mathcal{O}(\log N)


Comments

There are no comments at the moment.