Neha and array

CodeChefOpen on judge ↗

Neha has been given an integer array $A$ of size $N$. Now, she needs to find the number of increasing sub-sequences of this array with length greater than or equal to $1$ and $GCD = 1$ . A sub-sequence of an array is obtained by deleting some (or none) elements and maintaining the relative order of the rest of the elements. As the answer may be large, print it $Modulo 10^9 + 7$ ###Input Format

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