Graph 19: Game Routes:: Topological Sorting(CSES 17: 1681)

Описание к видео Graph 19: Game Routes:: Topological Sorting(CSES 17: 1681)

A game has n levels, connected by m teleporters, and your task is to get from level 1 to level n. The game has been designed so that there are no directed cycles in the underlying graph. In how many ways can you complete the game?


Problem Link: https://cses.fi/problemset/task/1681
Solution Link: https://ideone.com/GARnIV

Комментарии

Информация по комментариям в разработке