"[The Euclidean algorithm] is the granddaddy of all algorithms, because it is the oldest nontrivial algorithm
that has survived to the present day."

-- Donald Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd edition (1981).

# The Greatest Common Divisor

The greatest common divisor (GCD), also known as the greatest common factor of two or more integers (at least one of which is not zero), is the largest positive integer that divides a number without a remainder. For example, the GCD of 8 and 12 is 4.

You are given an arbitrary number of positive integers. You should find the greatest common divisor for these numbers.

**
Input:
**
An arbitrary number of positive integers.

**
Output:
**
The greatest common divisor as an integer.

**
Example:
**

greatest_common_divisor(6, 4) == 2 greatest_common_divisor(2, 4, 8) == 2 greatest_common_divisor(2, 3, 5, 7, 11) == 1 greatest_common_divisor(3, 9, 3, 9) == 3

**
Precondition:
**

1 < len(args) ≤ 10

all(0 < x ≤ 2 ** 32 for x in args)

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)

checkio serv -d

Alternatevly, you can install Chrome extension or FF addon

checkio install-plugin

checkio install-plugin --ff

checkio install-plugin --chromium

Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.