Subsequence LCM

CodeChefRating 2527Open on judge ↗

You are given an array $A$ consisting of $N$ integers. Find the number of [subsequences](https://en.wikipedia.org/wiki/Subsequence) $S$ having length $M$ such that: - $M$ $\gt$ $1$; - For any pair of indices $(i,j)$ in the subsequence $S$, $(lcm(M, S_i) - S_i) = (lcm(M, S_j) - S_j)$. Here $lcm(a,b)$ denotes the [lcm](https://en.wikipedia.org/wiki/Least_common_multiple) of integers $a$ and $b$.

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