Hide
Problem A
Euclid's Algorithm
Languages
en
is
You are given positive integers $a, b$ and should print the greatest common divisor of $a$ and $b$.
Input
The first and only line of input contains positive integers $a, b \leq 10^{18}$ separated by a space.
Output
Print the greatest common divisor of $a$ and $b$.
| Sample Input 1 | Sample Output 1 |
|---|---|
49 91 |
7 |
