Help me!!

CodeChefOpen on judge ↗

Chef lives in the city Chefland. Chefland consists of N offices (numbered 1 through N), connected by M roads. Due to heavy traffic in Chefland, Each road is one-way road. Chef wants to go from his office 1 to chefna’s office N. Chef asks you in how many ways he can do so? Input The first input line has two integers n and m: the number of offices and road. The offices are numbered 1,2,…,n.

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