SUBARRAY GCD

CodeChefOpen on judge ↗

Chef has been spending some time learning GCD and became fond of it.Chef's tutor gave him a problem. Chef has an array A of N elements and a set of Q queries. Each query is of type L R, where 1 ≤ L ≤ R ≤ N. For each query Chef has to calculate two space separated integers Gmax and Gmin Where, Gmax = max{gcd(Ai,Ai+1,Ai+2,....Aj) | L ≤ i ≤ j ≤ R } Gmin = min{gcd(Ai,Ai+1,Ai+2,....Aj) | L ≤ i ≤ j ≤

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