[UVA][gcd變形] 10104 - Euclid Problem
Euclid Problem
The Problem
From Euclid it is known that for any positive integers A and B
there exist such integers X and Y that AX+BY=D,
where D is the greatest common divisor of A and B.
The problem is to find for given A and B corresponding X, Y and D....
