Question

#include <stdio.h> // function prototype unsigned int gcd(unsigned int x, unsigned int y); int main() { unsigned int gcDiv; // greatest common divisor of x and y printf("%s", "Enter two integers: "); unsigned int x; // first integer unsigned int y; // second integer scanf("%u%u", &x, &y); gcDiv = gcd(x, y); printf("Greatest common divisor of %u and %u is %u ", x, y, gcDiv); } unsigned int gcd(unsigned int x, unsigned int y) { }

          #include <stdio.h>

// function prototype
unsigned int gcd(unsigned int x, unsigned int y);

int main()
{
    unsigned int gcDiv; // greatest common divisor of x and y

    printf("%s", "Enter two integers: ");
    unsigned int x; // first integer
    unsigned int y; // second integer
    scanf("%u%u", &x, &y);

    gcDiv = gcd(x, y);

    printf("Greatest common divisor of %u and %u is %u
",
           x, y, gcDiv);
}

unsigned int gcd(unsigned int x, unsigned int y)
{

}

#include <stdio.h>

// function prototype
unsigned int gcd(unsigned int x, unsigned int y);

int main()

unsigned int gcDiv; // greatest common divisor of x and y

printf("%s", "Enter two integers: ");
unsigned int x; // first integer
unsigned int y; // second integer
scanf("%u%u", &x, &y);

gcDiv = gcd(x, y);

printf("Greatest common divisor of %u and %u is %u
",
x, y, gcDiv);

unsigned int gcd(unsigned int x, unsigned int y)

Added by Rosario B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Aarya B

06/27/2023

Step 1

Include the stdio.h header file. Show more…

Show all steps

Thanks for your feedback!

#include <stdio.h> // Function prototype unsigned int gcd(unsigned int x, unsigned int y); int main() { unsigned int gcDiv; // Greatest common divisor of x and y printf("Enter two integers: "); unsigned int x; // First integer unsigned int y; // Second integer scanf("%u%u", &x, &y); gcDiv = gcd(x, y); printf("Greatest common divisor of %u and %u is %u ", x, y, gcDiv); } unsigned int gcd(unsigned int x, unsigned int y) { if (y == 0) { return x; } else { return gcd(y, x % y); } }