SPEED  Circular Track
Two persons are running on a circular track either in the same direction or in the opposite direction, indefinitely. The speed of both of them is given to you. Speed will be positive in clockwise direction, and negative in anticlockwise direction. Print the number of distinct points, at which they will meet on the circle.
Input
First line contains T, number of test cases. Each test case contains two integers, S1 and S2 (not equal to zero) which are the speeds of the two persons. S1 and S2 will be distinct.
Edited: All the numbers fit in signed 32bit integer.
Output
Print in a separate line, the number of distinct points at which they meet.
Example
Input 2 1 2 1 1 Output 1 2
hide comments
vineetpratik:
20160701 17:04:03
Hint 1: you have to find distinct points at which they both meet(after some time those points keep on repeating but number of distinct points is finite)


dwij28:
20151226 01:37:21
Test cases are relatively weak. My highly UNoptimised / slow code gave 0.0 seconds.. 

darkhire21:
20151026 19:33:00
don't mention hint in comments ...!! 

impossible_1:
20150924 08:12:26
euclidean algorithm of gcd .......then easy.


shubham agrawal:
20150815 12:55:51
xpshekhar..


xpshekhar:
20150811 22:48:43
can anyone please tell what will be output at (1,1) or (0,2)


MishThi:
20150805 22:45:16
Nice concept. :P 

anuveshkothari:
20150726 17:27:49
you have to find all the distinct points where they can meet until they meet again at starting point after some time..


SangKuan:
20150702 07:33:04
nice math 

r0bo_dart:
20150625 13:47:41
math, math and math + Euclidean algorithm for gcd 
Added by:  Nikunj Jain 
Date:  20110721 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 