ENIGMATH - PLAY WITH MATH
You would have been fed up with competitive programming questions so far, now it is time to solve little math.
Assume you have a equation A * x - B * y = 0
For a given value of A and B, find the minimum positive integer value of x and y that satisfies this equation.
First line contains T, number of test cases 0 <= T <=1000 followed by T lines.
First line of each test case contains two space seperated integers A and B. 1 <= A, B <=1 000 000 000.
For each test case, output a single line containing two integers x and y (seperated by a single space).
Input: 1 2 3 Output: 3 2
- Brute force won't pass the given constraint.
- Negative number cases are avoided to make the problem easy.
careless me :( "Print new line after each test case." ..... costed 2 WAs...
got ac in first attempt
Nice one! if u get the logic,then it is simple
Easy one. Green in first go.
It's such an easy game :))
Nice !! Related Question is Crucial Equations (pc:CEQU).