Adjacent Product

AtCoder

IDabc346_a

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

3
3 4 6

Output #1

12 24

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

Input #2

5
22 75 26 45 72

Output #2

1650 1950 1170 3240

API Response (JSON)

{
  "problem": {
    "name": "Adjacent Product",
    "description": {
      "content": "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.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc346_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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)$.\nPrint $B_1, B_2, \\dots, B_{N-1}$ in this order, separated by spaces.\n\n## Constraints\n\n*...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments