Ski resort

Authors

  • Pavel Töpfer Faculty of Mathematics and Physics, Charles University, Prague

Abstract

The article from the series dedicated to problems of Mathematical Olympiad – category P (programming) describes a competition task from the regional round of the 2015/16 school year. Our task is to find the number of possibilities the skier can stop for refreshments in a buffet during one ride in the winter ski resort. It is really the task of searching for possible paths in a directed graph according to given criteria. The solution uses DFS or BFS algorithm in the first part, dynamic programming in the second part.

Published

2017-04-30

How to Cite

Töpfer, P. (2017). Ski resort. MATHEMATICS–PHYSICS–INFORMATICS, 26(3), 227–236. Retrieved from https://www.mfi.upol.cz/index.php/mfi/article/view/343

Issue

Section

Informatics