LCM and HCF

CodeChefOpen on judge ↗

You are given a positive integer $N$. Your task is to calculate total number of pairs (i,j) such that $1\leq i, j \leq N$ and $HCF(i,j) = LCM(i,j) $. Here HCF denotes the highest common factor and LCM denotes the lowest common multiple. ###Input: - The first line of the input contains a single integer T denoting the number of test cases. The description of test cases follows. - The F

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