Minimum Sum

CodeChefOpen on judge ↗

You are given an array of $N$ integers. You want to minimize the sum of this array. For doing this you are allowed to perform any number of operations. In one operation you can select a subsequence $(length>1)$ of the array and divide the elements of this subsequence by their any common divisor $( >1 )$. You can apply this operation any number of time (even zero). Find the minimum sum of the a

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