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

@priyamthakuria27 hey,here is code for reference:

#3

this code shows wrong answer.

#4

@priyamthakuria27 hey apko input wgarah change krna pdega mene khali initialise array lia hai ap ko input lekr khud modify krna pdega code.

#5

input string hai. kaise lena hai?
if you could make the necessary changes and make the sample test case pass?

#6

what is wrong in this code?

#7

@priyamthakuria27 whereto take input of m ,test cases ke input me dikkt hai koi ,first line me test cases hai than each test case ka size kha se le hm that is array size?

#8

@priyamthakuria27 hey there is problem in input ,where to take m as input whixh is size of array ,and also tc ke bad seedha array input lia hai without size,please check question again.

#9

this is the correct question. the array is to be taken as input as a string and then extract the integers.
did you check my code?

#11

@priyamthakuria27 hey then take input according to the question and store in array and count elements ,it will work as the function I have given will work efficiently and properly.

#12

it isn’t working. please check my code and make the necessary changes please.

your code says, reached end of non void function.

#13

@priyamthakuria27 bro apki input parsing galat hai ,traverse the string and create number of terms until space arrived,supose 20 6 5 so take num=1 so add current term to 10*num and than next and so on until space arrive,ye apko ek number dega,use array me store kra lo and length++ krdo ,and after that jo array form hui use function me as argument pass krdo chl jayega.