ACM: Q001 (★☆☆☆☆)
Write a program that finds the GCD (greatest common divisor) of two numbers. . Input and Output The input contains several lines of data, one pair of integers a and b per line. (0<a,b<10000000) A line with 0 0 marks the end of the input. For each input line, output the GCD of those two numbers. . Sample Input 12 36 25 24 0 0 Sample Output GCD(12,36)=12 GCD(25,24)=1 ...