Not Divisible

CodeChefOpen on judge ↗

You are given an array $A$ of integers of size $N$ and $Q$ queries. For each query, you will be given a prime integer $P$ and two integers $L$ and $R$ that represent a range in the array. Your task is to print the index of the first number in the range that is not divisible by the prime $P$ or determine that it doesn't exist. ###Input: - First line will contain $N$, the number of integers in the

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