← All problemsSign in

Minimum Product

CodeChefRating 2314Open on judge ↗

You are given a array A of N positive integers, and you can perform the following operation on the array 1) Pick any two indices i and j in the array 2) Divide A[i] and A[j] by some common factor of A[i] and A[j] You can perform the above operation as many number of times as you want, and the aim is to minimize the product of the resulting array. Find this minimum product. Since the answer can

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

Sign in to chat with the tutor and save your progress.

Sign in to start