Graph Wali VIP

CodeChefOpen on judge ↗

All submissions for this problem are available. There are n houses in a city called Mitsone, numbered from 1 to n. Sagar wants to visit all the houses of Mitsone but he found that there is no path between some of the houses. He found that there is a path between 2 houses a and b is possible only if b = k*a, where k is a natural number. Here is an interesting thing, first house is destroyed by a

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