Black Board

CodeChefOpen on judge ↗

A chef was called to the board by his teacher and was given N number of elements. He was then given another number x. The chef was told to find product of all the subsets of that set of elements and was informed about the condition that the product should be less than to the given number x. So your task is to help the chef to find the appropriate number of subsets that fulfils the condition give

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