Queries with GCD

CodeChefOpen on judge ↗

You are given a sequence A with N elements and Q queries on this sequence. In each query, you are given two indices L and R; you should compute the maximum value of the greatest common divisor (GCD) of two elements Ax, Ay satisfying L ≤ x y ≤ R. Input - The first line of the input contains two space-separated integers N and Q. - The second line contains N space-separated integers A1, A2, ..., A

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