← All problemsSign in

Kamehameha

CodeChefRating 2099Open on judge ↗

Read problems statements in Mandarin Chinese here City of Byteland can be described as a $2D$ grid of cells. Each cell may or may not contain a demon. You are given the list of cells that contain demons. In a single Kamehameha attack, Goku can kill all the demons standing in a row or in a column. But using Kamehameha drains Goku's power. You are to tell the minimum number of Kamehameha attacks t

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

Sign in to chat with the tutor and save your progress.

Sign in to start