package edu.unca.cs.csci202;

/**
 *
 * @author J Dean Brock <brock@unca.edu>
 */
public class GCD {

    private static int euclid(int m, int n) {
        if (m==n) {
            return m ;
        } else {
            int mNxt ;
            int nNxt ;
            if (m>n) {
                mNxt = m-n ;
                nNxt = n ;
            } else {
                mNxt = n ;
                nNxt = m ;
            }
            return euclid(mNxt, nNxt) ;
        }
    }
    
    public static void main(String[] args) {
        java.util.Scanner stdin = new java.util.Scanner(System.in) ;
        System.out.println("Enter two numbers") ;
        int p = stdin.nextInt() ;
        int q = stdin.nextInt() ;
        System.out.println() ;
        System.out.println(
                "The GCD of " + p + " and " + q + " is " + euclid(p, q)) ;
    }
}