Cost Finder

CodeChefOpen on judge ↗

This is a simple cakewalk problem.In this problem you have to print shortest path from one point to another. Input: - First line of the input contains an integer N denoting the number of groups. Description of N groups follows. - Next N lines will consist of a single line containing maximum M space separated integers I. - Last line of input will contain 2 space separated integers A and B. Out

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