CT1214

Vermilion stamps Product

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The customs officer Zane has been asked to prepare the guildmaster's brief. On the desk lies a long table of stamps readings. Task: Read n integers and print their product. Input format: First line: n. Second line: n space-separated integers. Output format: Print the product of all n values. Constraints: 1 <= n <= 15; -5 <= a[i] <= 5; the product fits a signed 64-bit integer.

Example 1:

Input: 14 -2 2 5 4 -3 4 1 -5 0 -2 -4 1 0 5
Output: 0

Example 2:

Input: 2 3 -5
Output: -15

Example 3:

Input: 11 1 -2 4 -4 -4 -4 -3 5 -1 3 1
Output: 23040

Constraints:

1 <= n <= 15; -5 <= a[i] <= 5; the product fits a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.
Vermilion stamps Product - EASY Coding Problem | CodeTikki