Left Most Digit of a product
Easy Accuracy: 33.79% Submissions: 290 Points: 2

You will be given an array A[ ] of positive integers, the task is to find the left most digit of the product of the numbers in this array.

Input:
The first line of input contains a single integer T denoting the number of test cases.Then T test cases follow. The first line of each test case consists of N, the size of the array. In the next line are N space separated positive integers which are in array A[ ].

Output:
Corresponding to each test case, in a new line, print the left most digit of the product of the numbers in the array A[ ].

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 100
1 ≤ A[i] ≤ 1010

Example:
Input:
1
4
872 742 72578 7857

Output:
3

 

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.