Counting LCM (Easy)

CodeChefRating 1740Open on judge ↗

**This is the easy version of the problem. The only difference between the easy and hard versions is the constraints on $Z$.** Chef has a favourite number $Z$. He wants to count the number of pairs $(X, Y)$ such that: - $1 \le X \le Z$ - $1 \le Y \le Z$ - $\text{lcm}(X, Y) > Z$ ### Input - The first line contains a single integer $T$ — the number of test cases. Then the test cases follow. - The

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