GCD

easy

Take as input tow numbers n1 and n2. Calcualte their gcd. Print it.

Input Format

Integer

Output Format

Integer

Constraints

 n1<= 10 ^ 9  , n2<= 10 ^ 9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Reverse Integer

Fibonacci

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list easy Sum Of Last K Nodes In A Linked List