gcd

Functions16

Objective

Write a program that prints the greatest common divisor of two strictly positive integers.

Steps

The program receives exactly two decimal strings that fit in an int.
Print their greatest common divisor followed by a newline.
If the number of arguments is not 2, print wrong number of arguments followed by a newline.
You may use printf and atoi.

examples

$ ./gcd 36 48

$ ./gcd 100 75

$ ./gcd

wrong number of arguments

Constraints

Expected files

gcd.c

Allowed functions

printfatoi

Tests

Run the tests to grade your code

Build

01No arguments

02GCD of 36 and 48 is 12

03GCD of 100 and 75 is 25

04GCD of 60 and 36 is 12

05GCD of 9 and 6 is 3

06Coprime inputs

gcd

Objective

Write a program that prints the greatest common divisor of two strictly positive integers.

Steps

The program receives exactly two decimal strings that fit in an int.
Print their greatest common divisor followed by a newline.
If the number of arguments is not 2, print wrong number of arguments followed by a newline.
You may use printf and atoi.

examples

$ ./gcd 36 48

$ ./gcd 100 75

$ ./gcd

wrong number of arguments

Constraints

Expected files

gcd.c

Allowed functions

printfatoi

gcd

Functions16

Objective

Write a program that prints the greatest common divisor of two strictly positive integers.

Steps

The program receives exactly two decimal strings that fit in an int.
Print their greatest common divisor followed by a newline.
If the number of arguments is not 2, print wrong number of arguments followed by a newline.
You may use printf and atoi.

examples

$ ./gcd 36 48

$ ./gcd 100 75

$ ./gcd

wrong number of arguments

Constraints

Expected files

gcd.c

Allowed functions

printfatoi

Tests

Run the tests to grade your code

Build

01No arguments

02GCD of 36 and 48 is 12

03GCD of 100 and 75 is 25

04GCD of 60 and 36 is 12

05GCD of 9 and 6 is 3

06Coprime inputs