Just Substract IT

CodeChefOpen on judge ↗

It’s the time for IPL auction and you have an array of N Players and an integer K i.e the Number of teams. Each player has a base price of A[i] .You are allowed to perform an operation several times. You can choose any two players let it be I and J (1<=I< j <=n) present in the array which has the same remainder when their base price divided by k and you have to erase data of those two players

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