GCD / HCF of Two Numbers

Difficulty: Medium

Phase: 2 · Looping and Patterns

XP Reward: 20 XP

Topics: Looping and Patterns, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given two positive integers A and B on separate lines, find their Greatest Common Divisor (GCD) using loops. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 12 18

Output: 6

Explanation: Sample execution for input 12 18