Question

write code using void function

visor (GCD) of two integers is the largest nacd that returns the greatest com- its digits reversed. For example, 5.31 (Greatest Common Divisor) The greatest common divisor (GCD) of two in integer that evenly divides each of the numbers. Write a function gcd that returns the mon divisor of two integers. . . for Numeric Grades) Write a function qualityPoints that inputs a

i need the code in C++ but make sire u solve by using void function

Answer 1

Please find the details below:

#include <iostream>

using namespace std;

void greatestcommondivisor()

{

    int firstNumber,secondNumber,gcd,i;

    cout << " Enter the First Number :";

    cin >> firstNumber;

    cout << " Enter the Second Number : ";

    cin >> secondNumber;

    for (i = 1; i <= firstNumber && i <= secondNumber; i++)

    {

        if (firstNumber % i == 0 && secondNumber % i == 0)

        {

            gcd = i;

        }

    }

    cout << " The Greatest Common Divisor of " << firstNumber << " and " << secondNumber<< " is: " << gcd << endl;

}

int main()

{

    greatestcommondivisor();

}