Special Subsequence

CodeChefOpen on judge ↗

You are given a sequence of size $N$ and two integers $M$ and $K$. We call a [subsequence](https://en.wikipedia.org/wiki/Subsequence) $A$ special if it satisfies the following property: $$\bigg( \sum_{\forall x \in A}^{} x^2 \bigg) \% M = K$$ ###Input: - The first line contains an integer $T$ denoting the number of test cases - The first line of each test case contains 3 integers $N$ denoting th

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