Using the method of greatest common divisor to solve the problem

You can also use the most stupid method is short division, but if the number is larger than the efficiency of the problem is hehe.

 package SFBC;  /** * * can be used to find the simplest fraction  *< Span style= "color: #000000;"         > @author Trfizeng  * */public class GCD {public static void main (string[] args) { System.out.println (DOGCD ( 12 , 10      if  (0  == b) { return   A;  else   { return  dogcd (b, A%b); }    }}

View Code

Print

2

Using the method of greatest common divisor to solve the problem