Beautification of array
Chef has an array and he also likes beautiful things. So he wants to make his array as beautiful as possible. He defines the $Beauty$ of his array as the sum of all pairwise products of the elements of the array. $$ Beauty([A_1, A_2, \dots, A_N]) = \displaystyle\sum\limits_{i=1}^N\displaystyle\sum\limits_{j=i+1}^N A[i] \cdot A[j] $$ To make his array more beautiful, he can do the following ope
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.
Sign in to chat with the tutor and save your progress.
Sign in to start