#Q207. 「一本通 6.3 例 3」最大公约数
「一本通 6.3 例 3」最大公约数
Description
Given two positive integers and , find their greatest common divisor.
Input Format
The input consists of two lines. The first line contains a positive integer , and the second line contains a positive integer .
Output Format
Output a single integer on the first line, representing the greatest common divisor of and .
Sample 1
18
24
6
Constraints and Hints
For of the data, ;
For of the data, .