// L. M. Elbe Prob. 4.28 Filename prob428.java
// HW#4
// Finding the greatest common divisor
//
    import java.awt.*;
    import java.applet.Applet;
    import java.awt.event.*;

    public class prob428 extends Applet implements ActionListener  {

        Label label1, label2;                 // labels for both numbers
        TextField number1, number2;           // textfields for both numbers
        int  m, n;                           // global variables  integer

        //set up labels and text fields
        public void init()  {
        
            label1 = new Label( "Enter 1st number " );
            number1 = new TextField ( 10 );
            label2 = new Label( "Enter 2nd number " );
            number2 = new TextField ( 10 );

            number1.addActionListener( this );
            number2.addActionListener( this );

            add( label1 );
            add( number1 );
            add( label2 );
            add( number2 );
        }


        //* should be good to here like book example

     public void actionPerformed( ActionEvent e )
     {
         m = Integer.parseInt( number1.getText() );
         n = Integer.parseInt( number2.getText() );
         showStatus( Integer.toString( m ));  

     }
//** ALL ABOVE THIS LINE WORKS CORRECTLY INPUT NUMBERS DISPLAYS STATUS LINE **
}
     gcd();                // calls method gcd


//********************** start of gcd method ******************************
//                         The Math Works

     public int gcd();
     {
        while (m > 0)
        {
            if (m < n )
            {
                int temp = m;
                m = n;
                n = temp;
            }                    // end of if
        m -= n;
        }                        // end of while

        return m;
     }                           // end of method
    }                            // end of program