Penka Kamenova

My first steps in programming

The greatest common divisor (GCD) ([C#] – Loops, task 8)

| 0 comments

Rate this post

Write a program that calculates the greatest common divisor (GCD) of given two numbers. Use the Euclidean algorithm (find it in Internet).

Leave a Reply

Required fields are marked *.


Read previous post:
Factorial ([C#] Loops – task 6)

Write a program that, for a given two integer numbers N and X, calculates the sum S = 1 +...

Close