GCD of two numbers

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Find the GCD (greatest common divisor) of two nonnegative integers.

GC D (a, b) = ⎩ ⎨ ⎧ a, b = 0 b, a = 0 GC D (a m o d b, b), a \geq b GC D (a, b m o d a), a < b

Input

Two integers $a$ and $b (a, b \leq 2 \cdot 1 0^{9})$ .

Print the GCD of numbers $a$ and $b$ .

Input #1

Answer #1

Submissions 18K

Acceptance rate 49%