Prove Min Vertices to Remove(keteki)

CodeChefOpen on judge ↗

This problem is in reference to KETEKIR1(the other research problem in this contest), It is mandatory to atleast read the problem statement of KETEKIR1, before solving this problem. The solution to this problem is expected to have a WA. You need to find a graph, which can make the research paper finding wrong and thus help the researchers with new findings. Print that graph which would disprov

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