ACM on Lin's Blog

ACM: Q001 (★☆☆☆☆)

Sat, 25 Jul 2009 21:39:49 +0000

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

Lucky Cat's ACM Corner

Thu, 11 Jun 2009 18:00:45 +0000

Lucky Cat’s ACM Corner is a well-known website in the programming community.

It has lots of problems that let you practice your programming skills.

However, it doesn’t come with any solutions…………

It only gives you the problems and hints.

Go there to practice your programming skills!

URL: http://luckycat.kshs.kh.edu.tw/