Jack and Treasure

CodeChefOpen on judge ↗

Problem description. There are ‘n’ villages.Each village is represented in integers(1,2,3…………..,n).Jack now has a 2D array in which if the value at 'i'th row and 'j'th column is '1',there exists a route between village 'i' and village 'j' without passing through any other village.Jack is currently at village ‘a’ and there is a treasure at village ‘b’.The problem is that not all villages are conne

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