Country Tour

CodeChefOpen on judge ↗

A country has n cities, connected by m roads, and your task is to get from city 1 to city n. The country has been designed so that there are no directed cycles in the underlying graph. In how many ways can you complete the task? ###Input: The first input line has two integers n and m: the number of cities and roads. The cities are numbered 1,2,…,n. After this, there are m lines describing t

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI