CT632
The Product at Vermilion
EasyL2 · Byte BanditAcceptance: 0.0%XP: 10
The harbor bell rings at
the cinnabar mines of Vermilion; Viktor weighs the day's readings manifests and starts the calculations.
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; 1 <= a[i] <= 12; the product fits a signed 64-bit integer.
Example 1:
Input: 4
1 6 11 11
Output: 726
Example 3:
Input: 7
7 8 11 2 8 5 8
Output: 394240
Constraints:
1 <= n <= 10; 1 <= a[i] <= 12; the product fits a signed 64-bit integer.