12935 - Greatest Common Divisor
|
Time |
Memory |
| Case 1 |
1 sec |
32 MB |
| Case 2 |
1 sec |
32 MB |
| Case 3 |
1 sec |
32 MB |
| Case 4 |
1 sec |
32 MB |
| Case 5 |
1 sec |
32 MB |
| Case 6 |
1 sec |
32 MB |
Description
Given two integers, calculate their greatest common divisor.
Input
The input contains two integers between 2 and 10000.
Output
Output the greatest common divisor of the input pair, follow by a newline.
Tags