Maximum GCD

CodeChefOpen on judge ↗

You are given an array $A(a_1, a_2,..., a_n)$ of $N$ elements. You need to go through $A$ exactly once and do either of the following to each element: - Change the element by 1 (Increase it or decrease it by 1) - Leave the element unchanged. You need to find the maximum $GCD$ of the array that can be achieved after the operations. ###Input: - First line will contain $T$, number of te

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