[BOJ 9770] GCD
View as PDF
Submit solution
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text
Points:
2
Time limit:
1.0s
Memory limit:
128M
Problem types
Allowed languages
Write a program to find the max GCD (greatest common divisor) among any pairs of the input integers.
입력 형식
The input contains positive integers, greater than zero and less than 1 million. The input may include at most 100 integers.
출력 형식
Print out the max value of GCD of any pairs.
예제 입력
5 30 18
34 50 1 2
90 100 201 10347예제 출력
50
Comments