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.
Input
First line contains T, number of test cases 0 ≤ T ≤1000 followed by T lines.
First line of each test case contains two space separated integers A and B. 1 ≤ A, B ≤1 000 000 000.
Output
For each test case, output a single line containing two integers x and y (separated by a single space).
Example
Input: 1 2 3 Output: 3 2
Note:
- Brute force won't pass the given constraint.
- Negative number cases are avoided to make the problem easy.
hide comments
|
ss_1007:
2022-06-06 21:56:15
don't ignore "output a single line containing two integers x and y"\n ;)
|
|
manish_thakur:
2020-03-18 11:18:45
Don't look for hints in comments, observe for some time , and you'll be good to go!
|
|
saketvajp_123:
2019-12-20 11:05:58
take input as 130 and 117 and then check ....
|
|
swap99:
2019-03-26 08:44:59
EASY PEASY |
|
ankitpriyarup:
2018-12-19 19:25:17
Took me 2 WA finally ;) |
|
dhia01:
2018-09-14 03:56:52
Cari KPK nya habistu , a sama b nya di bagi sama KPK nya |
|
gourav_123:
2017-12-09 18:50:13
dont read comments.... |
|
nadstratosfer:
2017-12-02 03:23:07
Print minimum values of (x,y) not value of x&y, and not minimum value of x followed by matching y. Print each result on a separate line, don't insert additional newlines like comments suggest. Crap statement and crap judge: if a < b print the bigger value first else WA. WTF! |
|
him_novice:
2017-09-05 05:15:37
Easiest question... Don't forget to print new line. Costed me one WA |
|
looser69:
2017-04-08 09:28:06
easy !! accepted in one go!!!use gcd |
| Added by: | B.R.ARVIND |
| Date: | 2013-09-12 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS