Calculates and displays the GCD of 2 integers

Question

Write a program that asks the user to enter two integers, then calculates and displays their greatest common divisor (GCD).

Hint: The classic algorithm for computing the GCD, known as Euclid's algorithm, goes as follow: let m and n be variables containing the two numbers. If n is 0, then stop: m contains the GCD. Otherwise, compute the remainder when m is divided by n. Copy n into m and copy the remainder into n. Then repeat the process, starting with testing whether n is 0.

Example input: 

12 28

Example output:

4

 

Answer 1

Hidden content!
#include  *   * *  ****  
int main()
{
* *       **   ********   *  n1, n2, i, gcd;
* **  ** *** **  ** * *   **  *    ***  %d", &n1, ** *  ** 
******   **  *** *   *  * *
   *   * * *     ** * **  **   * ** i <= n1 **   * **  * i <= n2; ++i)
  *  * *** **   * ****** 
**   * *** *****  * **     ******  **    ***     **    ***  * Checks if i is factor of both integers
 * *  *** ***  ** *    *  *  **   ** * **  ***  *******  **     *  *     n2%i==0)
**    *** * *** * ** *  * *  *** **  *     *  ** * ** = i;
** * **   *** *   *  * ***  **   
* ** *  * *  *** 
* ** ** *** *   **  ** * **** ***  ****   *   **  gcd);
*** * * * * **** ** *** * ** ***    * 0;
}

Comments

Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output

Answer 2

Hidden content!
#include   **    ** **** ***
int main()
{
 * ** **  *  **  ** *   *** *** n1, n2, i, gcd = 0;
**   ****  *****    *   *
**  *    * * * *   ****  *        * **   * *****   * * *****   * ** ***    %d", &n1, &n2);
  **    ** *   ***    ** *
****  *  **** *  *    *  * ** * *  i <= n1 && i <= n2; ++i)
 *   **    *** **  * ******
 **  **  ** * **  * *** * * * *      *  *   *  *  *   * *  *  && n2%i==0)
*        * ** ** *  ***** ***  * * * * * **  *   * * ***  *  * * **  ****  *** **  **  *   = i;
*  ** ** **  **  ** **** 
 *    *  *  ** *  *   * **
 ** * *   ** *  *** **  **  **  *      *** 
** ***    *  **  ** ** 
* *   *   *** * * * **** *** *    0;
}

Comments

Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output