CT701

Jace's Ledger of parcels

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The council of the garden city of Petalbrook pays by the answer, and Jace intends to earn it. First: the full register of parcels. 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 <= 10; 0 <= a[i] <= 5; the product fits a signed 64-bit integer.

Example 1:

Input: 6 2 4 3 0 0 3
Output: 0

Example 2:

Input: 6 0 3 4 3 2 0
Output: 0

Example 3:

Input: 10 2 1 1 5 3 1 1 0 4 4
Output: 0

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Jace's Ledger of parcels - EASY Coding Problem | CodeTikki