Magic numbers
Submissions: 3957   Accuracy:

18.91%

  Difficulty: Easy   Marks: 2

Given two function, one is h(x) which includes the products of all the number in an array A[ ] having size N and another function f(x) which denotes the GCD of all the numbers in an array.Your task is to find the value of  h(x)f(x).

Note: Since the answer can be very large, use modulo 109+7.

Input:
The first line contains an integer T, the number of test cases. Then T test cases follow. Each test case contains two lines. The first line of each test case contains an integer N denoting the size of the array A. The Next line will contain N-space separated integer values i.e A[i].  

Output:
Print the required answer in a new line

Constraints:
1 <= T <= 26
1 <= N <= 60
1 <= A<= 104

Example:
Input:              
1                  
2
2 4
Output:
64

Explanation:
Testcase1:Product of the array elements is 8 and GCD of the elements is 2. So 82=64.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: vaibhav garg
Author: justrelax


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.