Module: GCD (Pembahagi Sepunya Terhebat)


Problem

1 /10


GCD pendek

Problem

Dua nombor diberikan. Cari pembahagi sepunya terbesar mereka.
 
Input 
Dua nombor asli tidak melebihi 30000 dimasukkan.
 
Imprint 
Keluarkan GCD bagi nombor yang dimasukkan.
 
 
Contoh
 

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!

# Input Output
1 42 12 6