Strong Elements

CodeChefRating 1507Open on judge ↗

Chef has an array $A$ of length $N$. An index $i$ is called *strong* if we can change the [gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor) of the whole array just by changing the value of $A_i$. Determine the number of *strong* indices in the array. ### Input - First line will contain $T$, number of test cases. Then the test cases follow. - First line of each test case contains an i

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