1011 Greatest common divisor gcd

1011 Greatest common divisor GCD

Base time limit:1 seconds space limit:131072 KB

Enter 2 positive integers a,b, ask a and b the greatest common divisor.

Input

2 number A, B, separated by a space in the middle. (1<=, b <= 10^9)

Output

Outputs A and B of the greatest common divisor.

Input Example

30 105

Output Example

15

ImportJava.util.Scanner; Public classMain {Static intgcdintAintb) {        returnA%b==0? B:GCD (b,a%b); }     Public Static voidMain (string[] args) {//TODO auto-generated Method StubScanner sc=NewScanner (system.in);  while(Sc.hasnext ()) {intA=Sc.nextint (); intb=Sc.nextint ();        System.out.println (GCD (A, b));    } sc.close (); }}

1011 Greatest common divisor gcd