CF1553F Pairwise Modulo
Description
You have an array $ a $ consisting of $ n $ distinct positive integers, numbered from $ 1 $ to $ n $ . Define $ p_k $ as $ $$$p_k = \sum_{1 \le i, j \le k} a_i \bmod a_j, $ $ where $ x \\bmod y $ denotes the remainder when $ x $ is divided by $ y $ . You have to find and print $ p\_1, p\_2, \\ldots, p\_n$$$.
Input Format
N/A
Output Format
N/A