Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
Given two numbers. Find the greatest common divisor.
Input
We introduce two positive integers not exceeding 10 9 .
Output
Derive GCD of the given numbers.
Для отправки решений необходимо выполнить вход.
|