← All problemsSign in

Beautiful Pairs

CodeChefRating 1548Open on judge ↗

You are given a sequence $A_1, A_2, \ldots, A_N$. An ordered pair of indices $(i,j)$ in this sequence is called a *beautiful pair* if $i \neq j$ and $\frac{A_i - A_j}{A_i} \lt \frac{A_i - A_j}{A_j}$. (Here, division represents real division, e.g. $\frac{5}{2}$ is equal to $2.50$.) Help Chef find the number of beautiful pairs present in the given sequence. **Note:** Since the input is large, pref

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

Sign in to chat with the tutor and save your progress.

Sign in to start