Special Number

CodeChefOpen on judge ↗

A number N is called special if it is the multiplication of two consecutive prime numbers. You are given Q queries.In each query you are given an integer N which is special.The answer for each query is the sum of all prime factors of N. Your task is to find the multiplication of all answers of the queries. ### Input The first line contains an integer, Q denoting the number of elements in Queries.

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