PERFECT_PRODUCT

CodeChefOpen on judge ↗

Given an Array of length $N$ containing elements $Ai$ *( i = 1 to n )* . You have to handle $Q$ queries on this array . Each Query is of two types *k=(1 or 2)*. Type 1:- $k$ $l$ $r$ in which you have to tell whether the product of numbers in range l to r results in a perfect square or not. if product of numbers in range $l$ to$r$ is a perfect square then simply output YES else output NO.

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