Problem

1 /9


Gcd panjang

Problem

Dua nombor diberikan. Cari pembahagi sepunya terbesar mereka.
 
Data input: Masukkan dua nombor asli tidak melebihi 10^9, (rekod 10^9 bermaksud "10 hingga kuasa ke-9", iaitu 1000000000).< /div >
Output: Cetak GCD 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