I did not understand this question. Can you provide me the solution?

#1

Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible
pair of these integers.

Input
The first line of input is an integer N (1 < N < 100) that determines the number of test cases.
The following N lines are the N test cases. Each test case contains M (1 < M < 100) positive
integers that you have to find the maximum of GCD.

Output
For each test case show the maximum GCD of every possible pair.

Sample Input
3
10 20 30 40
7 5 12
125 15 25

Sample Output
20
1
25

#2

Just take two loops and calculate gcd of every pair and calculate maximum.

#4

Think in this way, for(i=0 to n){ for(j=i+1 to n} { ans=max(ans,gcd(a[i],a[j])}} at the end print the ans.

#5

please check this code. it is saying segmentation fault