One Last Query Problem

CodeChefOpen on judge ↗

Problem description. You are given a set of $N$ numbers and $Q$ queries .Queries are of below three types . Initially $P=0$ . Type $1$ query : $1$ $A$ $B$ $C$ $D$ - insert a copy of $(P*A*B+C)modulo D$ to your set . Type $2$ query : $2$ $A$ $B$ $C$ $D$ - Remove a copy of $(P*A*B+C)modulo D$ from your set . Type $3$ query : $3$ $A$ $B$ $C$ $D$ - Find the number of elements strictly less than $(

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