LCM Sum

CodeChefOpen on judge ↗

Given n, calculate the sum LCM(1,n) + LCM(2,n) + .. + LCM(n,n), where LCM(i,n) denotes the Least Common Multiple of the integers i and n. Input : The first line contains T the number of test cases. Each of the next T lines contain an integer n. Output : Output T lines, one for each test case, containing the required sum. Sample Input : 3 1 2 5 Sample Output : 1 4 55 Constraints : 1 1

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