Largest K

CodeChefRating 1547Open on judge ↗

You are given an array $A$ of size $N$. Find the **largest** integer $K$ such that there exists a [subsequence](https://en.wikipedia.org/wiki/Subsequence) $S$ of length $K$ where $K$ is divisible by the number of **distinct** elements in $S$. ### Input - The first line contains a single integer $T$, denoting the number of test cases. - The first line of each test case contains a positive integ

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