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.
easy !! accepted in one go!!!use gcd
when a==b values of x and y are "1 1". i was putting 1.this give me 6 WA. Nice and easy.1 line of logic.
AC in one GO...!! Very Simple..!!
too easy :)
m getting WA plz check my code @http://ideone.com/xFuXzT
Easiest question till now!!!
think gcd of a and b
really simple as logic is one liner....
Last edit: 2016-08-14 10:39:02