← 返回题目
题库练习 Pairwise Modulo
← 上一题 下一题 →

A14400 | Pairwise Modulo

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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$$$.

输入格式

The first line contains $n$ — the length of the array ( $2 \le n \le 2 \cdot 10^5$ ).

The second line contains $n$ space-separated distinct integers $a_1, \ldots, a_n$ ( $1 \le a_i \le 3 \cdot 10^5$ , $a_i \neq a_j$ if $i \neq j$ ).

输出格式

Print $n$ integers $p_1, p_2, \ldots, p_n$ .

输入输出样例

输入 #1
4
6 2 7 3
输出 #1
0 2 12 22
输入 #2
3
3 2 1
输出 #2
0 3 5
C++ 编辑器
输入
输出