find GCD

CodeChefOpen on judge ↗

You are given an array$A$ consisting of $N$ integers and an integer $K$. You have to answer $Q$ queries on it. Each query belongs to one of the following two types: - $1$ $P$ $X$ : Replace element at position $P$ by $X$ - $2$ $L$ $R$: You have to perform the following operation between $L$ and $R$. You are allowed to perform the following operation any number of times (including zero):

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