Python Solution for Uva Problem: 11827 - Maximum GCD
Maximum GCD a problem from Uva online judge, let's solve it using python. Let me know if you got any better way of solving this.
Problem
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
Thanks.
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.