20140514_KUAS_VisualC++_Classwork_0507_Question_2_Answer

/***********************************************/
/** 20140514 Classwork_0507 Question 2 Answer **/
/** Maker  : Yan                              **/
/** E-Mail : [email protected]            **/
/** Date   : 2014/05/14 am.04:54              **/
/***********************************************/

#include <stdio.h>
#include <stdlib.h>

void find_GCD(int, int, int);

void main()
{
    while(1)
    {
        int input_a = 0, input_b = 0;
        printf("Enter a number of input_a: ");
        scanf("%d", &input_a);
        if(input_a == 0)
        {
            break;
        }
        printf("Enter a number of input_b: ");
        scanf("%d", &input_b);
        if(input_b == 0)
        {
            break;
        }

        int minimum = 0;
        if(input_a > input_b)
        {
            minimum = input_b;
        }
        else if(input_a < input_b)
        {
            minimum = input_a;
        }
        else if(input_a = input_b)
        {
            minimum = input_a;
        }

        find_GCD(input_a, input_b, minimum);
    }
    printf("Your Program is exiting ..\n");
    system("pause");
}

void find_GCD(int input_a, int input_b, int minimum)
{
    if((input_a % minimum == 0) && (input_b % minimum == 0))
    {
        printf("Greatest common divisor = %d.\n\n", minimum);
    }
    else
    {
        minimum -= 1;
        find_GCD(input_a, input_b, minimum);
    }
}