FINFRAC  Finding Fractions
English  Vietnamese 
Given a,b,c,d, find a fraction p/q with minimum q, and satisfied a/b < p/q < c/d .
Input
For each test case, one line contains four integers a,b,c,d .
Output
For each test case, print the fraction(see the sample for details).If multiple solution exists, output the one with minimum p.
Example
Input: 1 3 1 2 2 1 3 1 2 1 4 1 1000 1001 1001 1002 Output: 2/5 5/2 3/1 2001/2003
Constraints
Dataset 1: a,b,c,d ( 1 <= a,b,c,d <= 1e9, and a/b < c/d )
hide comments
prad_131:
20160817 19:48:29
Last edit: 20170627 14:44:34 

numerix:
20150220 16:39:04
It seems that testdata has been changed in the last days and a rejudge has taken place (?). All my (even years old) AC submissions show NZEC over night.


Bhavik:
20150216 02:15:53
learnt a new concept:) 

Simes:
20150216 02:15:53
@nitish rao:


nitish rao:
20150216 02:15:53
@nbit: for 1/2 and 3/4 is the answer (1+3)/(2+4) = 1/2 ?? hence its wrong.. 

nblt:
20150216 02:15:53
I have an idea:


Ashutosh:
20150216 02:15:53
time exceeding!!


Anant Sharma:
20150216 02:15:53
Is the input ever supposed to end or not? :P 
Added by:  Race with time 
Date:  20090219 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Code Craft 09 