← All problemsSign in

Terrorist Planning

Problem description. A terrorist group SRPY is thinking of destroying a country named JTRT. JTRT has N cities connected by E bidirectional roads. Cities are designated city number starting from 0 till N-1 . The group have decided to use bombs for causing destruction , but the group has one problem that is they have only B number of bombs with them . After gathering information about the populatio

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