Fractional Dilemma

CodeChefOpen on judge ↗

Akshat and Prashant are two close friends. One day they both created their own arrays $A$ and $B$, each containing $N$ elements. Prashant came up with an idea and challenged Akshat to complete it. The task is that Akshat has to count the number of unique fractions in newly created array $C$ where $C[i]$ $=$ $A[i]$ $/$ $B[i]$ for all $i$ in $1$ to $N$. Please note that Fractions are always represe

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