BETA
Cutting Rectangles
Submissions: 980   Accuracy:

19.69%

  Difficulty: Easy
       

Given a rectangle of dimensions a X b find the minimum number (n) of identical squares of maximum side that can be cut out from that rectangle so that no residue remains in the rectangle. Also find the dimension k of that square.

Input:

The first line of the input contains an integer 'T' denoting the number of testcases. Then T test cases follow. Each test case consits of a single line containing two space separated integers a and b denoting the dimensions of the rectangle.

Output:

For each test case print n and k (space separated ) in a new line.


Constraints:

1<=T<=30
1<=a,b<=10^9

Example:

INPUT:
3
2 4
3 6
2 8

OUTPUT:
2 2
2 3
4 2

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Hardik Gulati
Author: Mukesh Kumar 5


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.