"[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
Наибольший общий делитель (НОД), для двух и более целых чисел называется наибольшее число, которое делит каждое число из данных без остатка.
Даны несколько положительных чисел. Найдите НОД...
You should be an authorized user in order to see the full description and start solving this mission.
Settings
CheckiO Extensions
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=js 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.
