Prime Math

CodeChefOpen on judge ↗

Chef is very good at prime numbers. He scored A+ grade in every mathematical subjects. To challenge him his friend gave him to solve following question : You are given an array of $N$ positive integers where all integers are less than or equals to 10^6. Now you have to calculate the product of (number of primes + 3) of all subsets of that array. Two subsets of array are considered different if

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