Good Subsets

CodeChefOpen on judge ↗

Problem Description: Devanshi is sitting with her team.She assigns a task to her teammates to evaluate their problem solving skills.She has given an array containing N elements as A={a1,a2,a3...aN}. She ask them to check whether there exists a good subset or not. A good subset, say B is a subset which satisfies following statements: 1. B is a non-empty subset 2. There exists no integer x(x>1)

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