103460: [Atcoder]ABC346 A - Adjacent Product

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:10 Solved:0

Description

Score: $100$ points

Problem Statement

You are given $N$ integers $A_1, A_2, \dots, A_N$. Also, define $B_i = A_i \times A_{i+1}\ (1 \leq i \leq N-1)$.

Print $B_1, B_2, \dots, B_{N-1}$ in this order, separated by spaces.

Constraints

  • $2 \leq N \leq 100$
  • $1 \leq A_i \leq 100$
  • All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$
$A_1$ $A_2$ $\dots$ $A_N$

Output

Print $B_1, B_2, \dots, B_{N-1}$ in this order, separated by spaces.


Sample Input 1

3
3 4 6

Sample Output 1

12 24

We have $B_1 = A_1 \times A_2 = 12, B_2 = A_2 \times A_3 = 24$.


Sample Input 2

5
22 75 26 45 72

Sample Output 2

1650 1950 1170 3240

Input

Output

得分:100分

问题描述

给你$N$个整数$A_1, A_2, \dots, A_N$。同时定义$B_i = A_i \times A_{i+1}\ (1 \leq i \leq N-1)$。

按照顺序打印$B_1, B_2, \dots, B_{N-1}$,用空格隔开。

限制条件

  • $2 \leq N \leq 100$
  • $1 \leq A_i \leq 100$
  • 所有输入值都是整数。

输入

输入通过标准输入给出以下格式:

$N$
$A_1$ $A_2$ $\dots$ $A_N$

输出

按照顺序打印$B_1, B_2, \dots, B_{N-1}$,用空格隔开。


样例输入1

3
3 4 6

样例输出1

12 24

我们有$B_1 = A_1 \times A_2 = 12, B_2 = A_2 \times A_3 = 24$。


样例输入2

5
22 75 26 45 72

样例输出2

1650 1950 1170 3240

加入题单

算法标签: