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.
AC IN ONE GO!!
Don't look for hints in comments, observe for some time , and you'll be good to go!
take input as 130 and 117 and then check ....
For large number (a*b or b*a) you have to find gcd..
AC in one go!!
Last edit: 2019-01-19 20:21:37
Took me 2 WA finally ;)
Cari KPK nya habistu , a sama b nya di bagi sama KPK nya