Shil and Coprime Sum

CodeChefOpen on judge ↗

Shil has an array of N integers A1,A2....AN.He challenges you to calculate Coprime sum for this array. Coprime sum is define as Σ Σ max(i,j) * g(i,j) where i i and Aj are coprime to each other else it will be 0. - max(i,j) will be defined as max(Ai,Ai+1....Aj). Input First line of input consists of integer N.Next line consists of N integers A1,A2....AN. Output Print the coprime sum for

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