Question

Write a complete C++ program to ask the user to inter two integers and the program finds and display the greatest common divisor (GCD) of the two integers. Typical output screen should be as following:

Write a complete C++ program to ask the user to inter two integers and the program finds and display the greatest common divisor (GCD) of the two integers. Typical output screen should be as following: Enter two integers 18 27 The GCD is = 9

Answer 1

Program:

#include <iostream>

using namespace std;

// function definition of findGcd
int findGcd(int a, int b) 
{ 
    // Everything divides 0  
    if (a == 0) 
    
       return b; 
       
    if (b == 0) 
    
       return a; 
   
    // if a is equal to b then gcd is same(a or b)
    if (a == b) 
    
        return a; 
   
    // if a is greater than b then recursively call findGcd with parameter a-b and b
    if (a > b) 
    
        return findGcd(a-b, b); 
     
    // recursively call findGcd with parameter a and b-a
    return findGcd(a, b-a); 
} 

int main()

{
    
    // Integer veritable a and b is to store two integers
    int a, b;
    
    cout<<"Enter two integers";
    
    // read first integer to veritable a
    cin >> a;
    
    // read first integer to veritable b
    cin >> b;
    
    // call the function findGcd with a and b as parameters, to calculate gcd and store the result in veriable gcd
    int gcd = findGcd(a, b);
    
    // print the content in variable gcd
    cout << "The GCD is - " << gcd;
    
    return 0;
    
}

Screenshot:

main.cpp 8 9 #include <iostream> 10 11 using namespace std; 12 13 // function definition of findGcd 14 int findGcd(int a, int b) 15 { 16 // Everything divides o 17 if (a == 0) 18 19 return b; 20 21 if (b == 0) 22 23 return a; 24 25 // if a is equal to b then god is same(a or b) 26 if (a == b) 27 28 return a; 29 30 // if a is greater than b then recursively call findGcd with parameter a-b and b 31 if (a > b) 32 33 return findGcd(a-b, b); 34 35 // recursively call findGcd with parameter a and b-a 36 return findGcd(a, b-a); 37 } 38

38 39 int main() 40 41 - { 42 43 // Integer veritable a and b is to store two integers 44 int a, b; 45 46 cout<<"Enter two integers"; 47 48 // read first integer to veritable a 49 cin >> a; 50 51 // read first integer to veritable b 52 cin >> b; 53 54 // call the function findGcd with a and b as parameters, to calculate ged and store the result in veriable god 55 int gcd = findGcd(a, b); 56 57 // print the content in variable god 58 cout << "The GCD is - " «< god; 59 60 return 0; 61 62 } 63

Enter two intigers 18 27 The GCD is - 9 ... Program finished with exit code 0 Press ENTER to exit console. I