MCDLUS - Massimo Comune Divisore
The GCD of two numbers is the largest positive integer that divides the two numbers perfectly. Given two numbers find the GCD.
Input
A list containing two numbers.
Output
The GCD between the two numbers in the list.
Example
Input: [12,14] Output: 2
Added by: | giorgio.piccardo |
Date: | 2018-04-18 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | NCSHARP JULIA PYPY3 PYTHON3 |