50241 - Greatest common divisor

Guest

Section problems

• 50574 - Triangular Numbers
• 50578 - Mersenne prime
• 50581 - The roots of a quadratic eq...
• 50595 - Sum of the numbers
• 50599 - Sum of Squared Error (SSE...
• 50609 - Long division
• 50548 - Albanian Airlines
• 50243 - Sum of digits
• 50241 - Greatest common divisor
• 50240 - The numbers that are divisi...
• 50242 - Numbers whose sum of the...
• 50248 - Power of two
• 50341 - Separate Into Digits
• 50335 - Five Math Operators
• 50408 - Molecules
• 50304 - Number Pattern
• 50305 - John's Tasks

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 ⁹.
Output
Derive GCD of the given numbers.

Input

9 12

Output

Для отправки решений необходимо выполнить вход.

Sections > Arithmetic > problem:

50241 - Greatest common divisor

Section problems

Feedback