Find smallest values of x and y such that ax – by = 0
Submissions: 754   Accuracy:

44.33%

  Difficulty: Easy   Marks: 2

Given two values ‘a’ and ‘b’ that represent coefficients in “ax – by = 0”, find the smallest values of x and y that satisfy the equation. It may also be assumed that x > 0, y > 0, a > 0 and b > 0.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integers a and b.

Output:

Print the value of x and y repectively with a space between them. Print the answer for each test case in a new line.


Constraints:

1<= T <=100

1<= a, b <=1000


Example:

Input:

1

25 35

Output:

7 5

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

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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


to report an issue on this page.