Xometry (Easy Version)

CodeChefRating 1934Open on judge ↗

**This is the easy version of the problem. The only difference between the easy and hard versions is that in the easy version, all elements of $A$ are pairwise distinct.** You are given an array $A$ containing $N$ non-negative integers. Count the number of **ordered** quadruples $(i, j, k, l)$ such that: - $1 \leq i, j, k, l \leq N$; - The values $i, j, k, l$ are pairwise distinct; and - It is po

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