Yet Another GCD Problem

CodeChefOpen on judge ↗

You are given an array $A$ of $N$ integers. We can perform the following operation on the array as follows:- - Choose two indices $i$ & $j$ , such that $1 \le i , j \le N$ and set $A[i] = A[i] \times A[j]$. Find the minimum number of given operations required such that the $GCD$ of the entire array is greater than $1$. If no such solution exists, print $-1$. Recall that the $GCD$ of

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