Primes are my Enemies

CodeChefOpen on judge ↗

Every number n can be represented in the form (p1x1)*(p2x2) * ..... *(pnxn), where p1,p2,...pn are prime numbers. Given a number n, find x1+x2+...+xn. Input Format: First line of input contains T, the number of test cases. Each test case contains an integer n. Output Format: For each test case,output a single line containing the answer. Constraints: 15 Example: Sample Input: 5 6 2 12 9 1 Sa

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