CT730

Caramel parcels Product

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Morning light hits the coral atoll of Pearldeep as Wade unrolls the day's manifest of parcels. The tally will decide the next shipment. 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 <= 12; 1 <= a[i] <= 9; the product fits a signed 64-bit integer.

Example 1:

Input: 1 2
Output: 2

Example 2:

Input: 11 5 4 1 5 7 4 9 4 4 7 3
Output: 8467200

Example 3:

Input: 5 2 1 1 1 9
Output: 18

Constraints:

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

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