SPEED - Circular Track

no tags 

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.


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 32-bit integer.


Print in a separate line, the number of distinct points at which they meet.


1 2
1 -1


hide comments
Akshat Aggarwal: 2011-09-03 13:18:37

whats the constraints on maximum value on S1 and S2

Shizuo Heiwajima: 2011-09-01 13:16:46

What should be output for :
8 3
7 2
8 5
3 -2
-1 4

Gaurav Mittal: 2011-08-22 11:39:45

enough, why am i getting wrong answer
my sub. id is : 5548979.
could you please check it?

Last edit: 2011-08-22 12:14:32
Dravid: 2011-08-18 08:46:52

so simple....:D

arshak minasyan: 2011-08-07 08:46:08

@Alejandro Flores
the S1 and S2 are distnict)

Alejandro Flores: 2011-07-31 04:01:18

Hi !
What should be the output for:
1 1
?? 0 ?

Vimal Raj Sharma: 2011-07-28 07:29:13

awesome problem :)

nagesh: 2011-07-26 14:22:10

Nice one..:D

blashyrkh: 2011-07-25 18:56:08

@Hagen von Eitzen: no :)

Hagen von Eitzen: 2011-07-25 18:01:23

The sample cases seem to imply that the diameter of the track is approximately 0.31830988618379

Added by:Nikunj Jain
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)