Module: GCD (Greatest Common Divisor)


Problem

1 /10


Short GCD

Problem

Two numbers are given. Find their greatest common divisor.
 
Input 
Two natural numbers not exceeding 30000 are entered.
 
Imprint 
Output the GCD of the entered numbers.
 
 
Examples
# Input Output
1 42 12 6
 

time 1000 ms
memory 32 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!