Query On Primes

CodeChefOpen on judge ↗

You have an array P which has N numbers. Array index starts from 1. You have to perform Q queries on it. Queries can be of 3 types : 1 X Y : Update value at X by Y. 2 L R : Print largest prime number between L and R. (L and R inclusive) 3 L R : Print largest non-prime number between L and R. (L and R inclusive) Input The first line of the input contains integer N and Q. Next line contains N

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