|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Given two numbers, find the GCD of those 2 numbers.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains two space separated integers a and b.
Print the GCD of the two numbers.
1 <= T <= 100
1 <= a , b <= 1000